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 listMar 12, 2026 13:37Sergey SerebryakovSergey SerebryakovScore: 7,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:377,66291,397,60662,582,0001,009,0002,531,328
2Mar 12, 2026 13:377,66889,458,15762,633,0001,010,0002,277,376
3Mar 12, 2026 13:377,72188,678,94062,086,0002,002,0002,277,376
4Mar 12, 2026 13:377,81787,562,56062,884,0001,996,0002,277,376
5Mar 12, 2026 13:377,82590,356,05562,952,0001,998,0002,277,376
6Mar 12, 2026 13:377,83887,304,10663,058,0002,001,0002,445,312