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 22, 2026 18:22Charles CabergsCharles CabergsScore: 20,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 18:2320,127184,960,360164,057,0003,001,0002,519,040
2Apr 22, 2026 18:2320,132186,557,508164,098,0003,001,0002,535,424
3Apr 22, 2026 18:2320,132184,016,177165,098,0002,001,0002,527,232
4Apr 22, 2026 18:2320,152186,141,458165,264,0002,003,0002,322,432
5Apr 22, 2026 18:2320,159182,988,868165,322,0002,003,0002,519,040
6Apr 22, 2026 18:2320,168186,778,914165,398,0002,004,0002,514,944
7Apr 22, 2026 18:2320,927192,935,619170,708,0002,994,0002,514,944
8Apr 22, 2026 18:2320,932193,214,668172,736,0001,004,0002,519,040
9Apr 22, 2026 18:2320,942193,389,499170,825,0002,996,0002,351,104