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 listMay 14, 2026 05:19Victor MerckléVictor MerckléScore: 7,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 05:206,99668,381,55458,072,00002,113,536
2May 14, 2026 05:206,99765,359,50958,081,00002,113,536
3May 14, 2026 05:207,00067,311,97957,077,0001,024,0002,113,536
4May 14, 2026 05:207,00066,499,54357,056,0001,046,0002,113,536
5May 14, 2026 05:207,00567,449,57757,133,0001,012,0002,113,536
6May 14, 2026 05:207,01066,631,66657,170,0001,017,0002,113,536
7May 14, 2026 05:207,05268,810,17957,497,0001,040,0002,113,536
8May 14, 2026 05:207,06967,957,84157,587,0001,089,0002,113,536
9May 14, 2026 05:207,11568,396,55058,055,0001,004,0002,113,536