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:23Maya RebholzMaya RebholzScore: 7,153Success
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:246,84468,320,15651,721,0005,091,0002,117,632
2May 25, 2026 20:246,88168,074,76251,578,0005,535,0002,113,536
3May 25, 2026 20:247,13870,202,78353,669,0005,579,0002,113,536
4May 25, 2026 20:247,14571,662,63353,699,0005,612,0002,117,632
5May 25, 2026 20:247,15372,293,75853,857,0005,513,0002,117,632
6May 25, 2026 20:247,20572,093,59754,258,0005,550,0002,113,536
7May 25, 2026 20:247,24172,659,07754,499,0005,602,0002,117,632
8May 25, 2026 20:247,28171,049,91754,840,0005,597,0002,117,632
9May 25, 2026 20:247,28772,565,69054,899,0005,589,0002,113,536