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 23, 2026 22:49Maya RebholzMaya RebholzScore: 8,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 22:498,32179,842,22563,562,0005,504,0002,117,632
2May 23, 2026 22:498,33579,929,29063,509,0005,672,0002,113,536
3May 23, 2026 22:498,33781,751,60163,348,0005,853,0002,117,632
4May 23, 2026 22:498,34379,664,79963,611,0005,643,0002,113,536
5May 23, 2026 22:498,35381,162,46863,782,0005,553,0002,117,632
6May 23, 2026 22:498,36680,600,39963,946,0005,499,0002,113,536
7May 23, 2026 22:498,37480,361,35463,867,0005,641,0002,113,536
8May 23, 2026 22:498,38779,746,98464,011,0005,603,0002,117,632
9May 23, 2026 22:498,38879,689,19063,986,0005,639,0002,113,536