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 listApr 13, 2026 01:13Josu San MartinJosu San MartinScore: 5,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 01:134,97166,477,46639,248,0002,012,0002,285,568
2Apr 13, 2026 01:135,01167,469,52040,578,0001,014,0002,412,544
3Apr 13, 2026 01:135,07066,003,55841,079,0001,001,0002,285,568
4Apr 13, 2026 01:135,29667,051,29041,959,0001,998,0002,285,568
5Apr 13, 2026 01:135,30165,668,29641,999,0001,999,0002,285,568
6Apr 13, 2026 01:135,35667,322,69643,445,0001,010,0002,404,352