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 18, 2026 12:14boop34boop34Score: 8,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:158,93883,928,25373,181,0001,011,0002,113,536
2Jul 18, 2026 12:158,97284,057,71673,432,0001,038,0002,113,536
3Jul 18, 2026 12:158,97284,168,81073,465,0001,009,0002,113,536
4Jul 18, 2026 12:158,97384,137,00373,476,0001,006,0002,117,632
5Jul 18, 2026 12:158,97484,132,69773,481,0001,005,0002,113,536
6Jul 18, 2026 12:158,98485,564,77273,570,0001,005,0002,113,536
7Jul 18, 2026 12:158,98584,264,01973,554,0001,029,0002,113,536
8Jul 18, 2026 12:159,00084,280,03473,673,0001,034,0002,113,536
9Jul 18, 2026 12:159,06584,881,09074,237,0001,010,0002,113,536