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:42Maya RebholzMaya RebholzScore: 6,352Success
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:436,15265,102,36945,865,0005,202,0002,113,536
2May 25, 2026 20:436,16062,551,52045,939,0005,194,0002,113,536
3May 25, 2026 20:436,21563,128,01346,271,0005,320,0002,117,632
4May 25, 2026 20:436,22561,015,63146,459,0005,216,0002,117,632
5May 25, 2026 20:436,35264,976,57047,423,0005,299,0002,113,536
6May 25, 2026 20:436,54866,051,07148,952,0005,398,0002,113,536
7May 25, 2026 20:436,55164,448,57948,534,0005,840,0002,117,632
8May 25, 2026 20:436,59766,683,56849,292,0005,467,0002,117,632
9May 25, 2026 20:436,70068,200,62649,960,0005,653,0002,113,536