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:06Andrew EpsteinAndrew EpsteinScore: 95,193Success
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:0694,857797,686,315786,317,0001,002,0002,117,632stderr
2Sep 17, 2026 02:0695,136799,896,920788,627,0001,002,0002,117,632stderr
3Sep 17, 2026 02:0695,138799,876,639788,639,0001,008,0002,117,632stderr
4Sep 17, 2026 02:0695,146799,993,799788,713,0001,002,0002,117,632stderr
5Sep 17, 2026 02:0695,193800,426,940788,100,0002,008,0002,117,632stderr
6Sep 17, 2026 02:0695,263800,901,842789,688,0001,002,0002,117,632stderr
7Sep 17, 2026 02:0695,268801,012,684789,725,0001,007,0002,117,632stderr
8Sep 17, 2026 02:0695,301801,238,333789,998,0001,003,0002,117,632stderr
9Sep 17, 2026 02:0695,342801,638,880790,338,0001,007,0002,117,632stderr