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 12, 2026 11:02Victor MerckléVictor MerckléScore: 10,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 11:0210,09994,938,73082,671,0001,156,0002,113,536
2May 12, 2026 11:0210,10092,944,17982,661,0001,172,0002,113,536
3May 12, 2026 11:0210,10192,989,58982,669,0001,176,0002,113,536
4May 12, 2026 11:0210,10395,203,65682,839,0001,023,0002,113,536
5May 12, 2026 11:0210,10494,794,80982,698,0001,166,0002,113,536
6May 12, 2026 11:0210,10494,935,81182,673,0001,196,0002,113,536
7May 12, 2026 11:0210,10993,905,22582,713,0001,195,0002,113,536
8May 12, 2026 11:0210,11293,190,05682,744,0001,187,0002,113,536
9May 12, 2026 11:0210,11293,088,97082,923,0001,014,0002,113,536