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 listSep 5, 2026 13:03wnwnScore: 3,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:043,61038,395,76828,936,0001,034,0002,113,536
2Sep 5, 2026 13:043,62538,438,26428,968,0001,122,0002,113,536
3Sep 5, 2026 13:043,62838,534,69329,099,0001,014,0002,113,536
4Sep 5, 2026 13:043,63239,314,00729,088,0001,059,0002,113,536
5Sep 5, 2026 13:043,63838,640,23729,176,0001,021,0002,113,536
6Sep 5, 2026 13:043,64339,463,14229,139,0001,103,0002,113,536
7Sep 5, 2026 13:043,64639,370,28629,207,0001,057,0002,113,536
8Sep 5, 2026 13:043,68039,804,54129,450,0001,095,0002,113,536
9Sep 5, 2026 13:043,76140,374,22930,154,0001,070,0002,113,536