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 02:46Josu San MartinJosu San MartinScore: 5,124Success
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 02:474,88356,656,39639,339,0001,193,0002,469,888
2May 10, 2026 02:475,01054,432,04440,402,0001,183,0002,473,984
3May 10, 2026 02:475,08259,360,12840,985,0001,200,0002,478,080
4May 10, 2026 02:475,11358,919,03941,257,0001,188,0002,449,408
5May 10, 2026 02:475,12460,551,07541,310,0001,220,0002,469,888
6May 10, 2026 02:475,17659,881,58241,778,0001,191,0002,482,176
7May 10, 2026 02:475,21655,352,16642,135,0001,161,0002,473,984
8May 10, 2026 02:475,23159,274,83342,221,0001,199,0002,469,888
9May 10, 2026 02:475,23459,919,03042,266,0001,183,0002,478,080