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 10, 2026 16:34Josu San MartinJosu San MartinScore: 5,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 16:344,99661,735,60141,467,00002,281,472
2Mar 10, 2026 16:345,07669,166,77440,125,0002,006,0002,281,472
3Mar 10, 2026 16:345,12673,520,97541,534,0001,013,0002,412,544
4Mar 10, 2026 16:345,13872,541,08241,630,0001,015,0002,404,352
5Mar 10, 2026 16:345,27971,694,00241,828,0001,991,0002,408,448
6Mar 10, 2026 16:345,28167,644,93143,831,00002,281,472