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 listJul 7, 2026 04:03wnwnScore: 3,321Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:033,29037,377,87126,276,0001,032,0002,113,536
2Jul 7, 2026 04:033,29135,176,15526,294,0001,024,0002,113,536
3Jul 7, 2026 04:033,29935,175,12726,382,0001,005,0002,113,536
4Jul 7, 2026 04:033,30635,470,37626,421,0001,019,0002,113,536
5Jul 7, 2026 04:033,32135,661,19826,558,0001,014,0002,113,536
6Jul 7, 2026 04:033,32435,735,25226,559,0001,036,0002,113,536
7Jul 7, 2026 04:033,47237,830,25327,801,0001,020,0002,113,536
8Jul 7, 2026 04:033,47937,055,84227,855,0001,026,0002,113,536
9Jul 7, 2026 04:033,62645,254,09629,084,0001,017,0002,113,536