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 listSep 17, 2026 02:37Andrew EpsteinAndrew EpsteinScore: 3,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:373,37836,862,13527,012,0001,032,0002,113,536
2Sep 17, 2026 02:373,44137,375,94827,541,0001,022,0002,113,536
3Sep 17, 2026 02:373,44837,317,81627,598,0001,024,0002,113,536
4Sep 17, 2026 02:373,46737,527,51027,755,0001,025,0002,113,536
5Sep 17, 2026 02:373,49637,777,31627,983,0001,038,0002,113,536
6Sep 17, 2026 02:373,51837,844,00928,197,0001,009,0002,113,536
7Sep 17, 2026 02:373,52337,998,91628,195,0001,052,0002,113,536
8Sep 17, 2026 02:373,52337,918,68928,234,0001,013,0002,113,536
9Sep 17, 2026 02:373,53038,045,69028,219,0001,080,0002,113,536