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 5, 2026 20:06Kevin HeaveyKevin HeaveyScore: 9,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:068,97784,004,97073,242,0001,273,0002,121,728stderr
2Jul 5, 2026 20:068,99484,187,76573,398,0001,255,0002,121,728stderr
3Jul 5, 2026 20:069,00484,274,54473,493,0001,246,0002,121,728stderr
4Jul 5, 2026 20:069,02084,984,79273,847,0001,021,0002,121,728stderr
5Jul 5, 2026 20:069,02884,444,31473,672,0001,264,0002,121,728stderr
6Jul 5, 2026 20:069,02984,514,87473,665,0001,277,0002,121,728stderr
7Jul 5, 2026 20:069,03284,654,56773,960,0001,008,0002,121,728stderr
8Jul 5, 2026 20:069,03584,609,21073,972,0001,024,0002,121,728stderr
9Jul 5, 2026 20:069,05484,675,68574,147,0001,008,0002,121,728stderr