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 20, 2026 00:28Maya RebholzMaya RebholzScore: 14,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 00:2814,546131,480,635114,023,0006,709,0002,113,536
2May 20, 2026 00:2814,551131,945,044114,062,0006,716,0002,113,536
3May 20, 2026 00:2814,553132,512,357114,071,0006,719,0002,113,536
4May 20, 2026 00:2814,561130,945,309114,206,0006,655,0002,113,536
5May 20, 2026 00:2814,570132,812,008114,290,0006,647,0002,113,536
6May 20, 2026 00:2814,571130,848,686114,073,0006,870,0002,113,536
7May 20, 2026 00:2814,590132,060,254114,265,0006,838,0002,113,536
8May 20, 2026 00:2814,612131,665,537114,047,0007,238,0002,113,536
9May 20, 2026 00:2814,629133,737,124113,963,0007,464,0002,113,536