Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 10, 2024 20:02ivanivanScore: 397,571Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 20:02393,0903,290,879,4553,195,692,00066,951,0002,285,568
2Nov 10, 2024 20:02393,4653,298,465,4453,198,785,00066,974,0002,285,568
3Nov 10, 2024 20:02395,7703,318,666,8913,227,932,00056,963,0002,285,568
4Nov 10, 2024 20:02396,7353,329,235,2463,230,939,00061,960,0002,363,392
5Nov 10, 2024 20:02397,5713,322,298,6933,244,860,00054,980,0002,293,760
6Nov 10, 2024 20:02398,2773,333,918,6073,227,733,00077,969,0002,289,664
7Nov 10, 2024 20:02402,2833,361,389,9583,277,966,00060,980,0002,277,376
8Nov 10, 2024 20:02404,7443,392,685,7803,289,411,00069,966,0002,285,568
9Nov 10, 2024 20:02419,5843,508,955,6783,428,570,00053,977,0002,293,760