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 17:18Maya RebholzMaya RebholzScore: 9,508Success
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 17:199,49989,557,90776,669,0002,177,0002,113,536
2May 23, 2026 17:199,49988,161,29976,672,0002,175,0002,113,536
3May 23, 2026 17:199,50390,061,15576,676,0002,203,0002,113,536
4May 23, 2026 17:199,50789,963,16176,729,0002,186,0002,113,536
5May 23, 2026 17:199,50894,903,80476,677,0002,242,0002,113,536
6May 23, 2026 17:199,50990,219,58876,705,0002,221,0002,113,536
7May 23, 2026 17:199,50989,054,89976,688,0002,240,0002,113,536
8May 23, 2026 17:199,51391,328,88776,702,0002,260,0002,113,536
9May 23, 2026 17:199,51489,196,10376,668,0002,305,0002,113,536