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 10, 2026 19:24Josu San MartinJosu San MartinScore: 3,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:243,94840,129,06731,560,0001,216,0002,113,536
2May 10, 2026 19:243,95340,983,09231,570,0001,242,0002,113,536
3May 10, 2026 19:243,95340,436,93431,551,0001,259,0002,113,536
4May 10, 2026 19:243,96443,049,28431,725,0001,178,0002,113,536
5May 10, 2026 19:243,97240,290,55531,753,0001,218,0002,113,536
6May 10, 2026 19:243,97940,534,38831,828,0001,198,0002,113,536
7May 10, 2026 19:243,98640,406,65731,841,0001,246,0002,113,536
8May 10, 2026 19:244,08341,225,20232,868,0001,024,0002,113,536
9May 10, 2026 19:244,09143,705,41732,692,0001,267,0002,113,536