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 10, 2026 13:23wnwnScore: 3,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:243,25834,968,32827,048,00002,113,536
2May 10, 2026 13:243,26236,182,39727,080,00002,113,536
3May 10, 2026 13:243,29736,329,71227,372,00002,113,536
4May 10, 2026 13:243,41037,819,70228,307,00002,113,536
5May 10, 2026 13:243,41836,473,12228,371,00002,113,536
6May 10, 2026 13:243,42038,288,27727,362,0001,028,0002,113,536
7May 10, 2026 13:243,42437,888,21028,424,00002,113,536
8May 10, 2026 13:243,42841,705,08428,460,00002,113,536
9May 10, 2026 13:243,44538,389,74828,594,00002,113,536