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 listMay 25, 2026 20:04Maya RebholzMaya RebholzScore: 6,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:055,88458,946,25943,581,0005,263,0002,117,632
2May 25, 2026 20:055,88759,600,73043,377,0005,490,0002,113,536
3May 25, 2026 20:055,89859,762,20843,780,0005,175,0002,117,632
4May 25, 2026 20:055,96360,402,88744,298,0005,203,0002,113,536
5May 25, 2026 20:056,00363,065,72344,208,0005,623,0002,113,536
6May 25, 2026 20:056,06559,777,33044,796,0005,548,0002,113,536
7May 25, 2026 20:056,12261,851,37845,584,0005,231,0002,117,632
8May 25, 2026 20:056,21861,080,54146,052,0005,564,0002,117,632
9May 25, 2026 20:056,33563,063,86546,695,0005,888,0002,113,536