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 13, 2026 15:33Victor MerckléVictor MerckléScore: 7,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:337,88073,541,63465,408,00002,113,536
2May 13, 2026 15:337,88373,953,47764,422,0001,008,0002,113,536
3May 13, 2026 15:337,88475,030,87264,418,0001,023,0002,113,536
4May 13, 2026 15:337,88473,450,03664,405,0001,039,0002,113,536
5May 13, 2026 15:337,88772,890,10664,450,0001,019,0002,113,536
6May 13, 2026 15:337,88873,102,15464,455,0001,022,0002,113,536
7May 13, 2026 15:337,88972,784,56764,451,0001,035,0002,113,536
8May 13, 2026 15:337,89074,246,47564,475,0001,015,0002,113,536
9May 13, 2026 15:337,90673,227,72564,521,0001,104,0002,113,536