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 20, 2026 00:02Joshua MontrossJoshua MontrossScore: 8,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 00:028,91284,218,19072,698,0001,272,0002,113,536
2Sep 20, 2026 00:028,92484,387,26272,826,0001,245,0002,113,536
3Sep 20, 2026 00:028,93884,510,67872,964,0001,229,0002,113,536
4Sep 20, 2026 00:028,94084,617,51872,984,0001,222,0002,113,536
5Sep 20, 2026 00:028,94185,572,84573,086,0001,130,0002,113,536
6Sep 20, 2026 00:028,94685,575,39473,100,0001,156,0002,113,536
7Sep 20, 2026 00:028,94684,607,54173,101,0001,156,0002,113,536
8Sep 20, 2026 00:029,11986,097,80774,679,0001,011,0002,113,536
9Sep 20, 2026 00:029,21786,781,73575,370,0001,139,0002,113,536