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 listJan 2, 2026 18:33Josu San MartinJosu San MartinScore: 6,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 18:336,09279,103,67649,555,0001,011,0002,363,392
2Jan 2, 2026 18:336,12384,591,26348,827,0001,992,0002,281,472
3Jan 2, 2026 18:336,13277,005,13549,879,0001,017,0002,367,488
4Jan 2, 2026 18:336,13876,138,48647,950,0002,996,0002,293,760
5Jan 2, 2026 18:336,24177,400,22649,812,0001,992,0002,293,760
6Jan 2, 2026 18:336,27281,322,16350,054,0002,002,0002,510,848
7Jan 2, 2026 18:336,32680,371,75051,498,0001,009,0002,355,200
8Jan 2, 2026 18:336,37081,556,47751,873,000997,0002,289,664
9Jan 2, 2026 18:336,37680,603,58650,922,0001,996,0002,281,472
10Jan 2, 2026 18:336,38082,210,63850,959,0001,998,0002,293,760
11Jan 2, 2026 18:336,40779,184,79451,176,0002,006,0002,359,296
12Jan 2, 2026 18:336,43674,351,03053,416,00002,523,136