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 07:00Josu San MartinJosu San MartinScore: 4,119Success
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 07:014,09246,179,09932,846,0001,119,0002,482,176
2May 10, 2026 07:014,10348,249,10832,955,0001,106,0002,478,080
3May 10, 2026 07:014,10350,211,28532,920,0001,141,0002,486,272
4May 10, 2026 07:014,10649,562,08532,925,0001,158,0002,482,176
5May 10, 2026 07:014,11946,569,87133,045,0001,150,0002,478,080
6May 10, 2026 07:014,12449,943,10233,097,0001,138,0002,486,272
7May 10, 2026 07:014,13847,567,39833,316,0001,037,0002,486,272
8May 10, 2026 07:014,14150,323,26833,307,0001,064,0002,494,464
9May 10, 2026 07:014,14652,041,63333,364,0001,055,0002,486,272