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 05:01Josu San MartinJosu San MartinScore: 4,150Success
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 05:024,11851,107,98533,049,0001,133,0002,490,368
2May 10, 2026 05:024,12649,555,06233,106,0001,145,0002,490,368
3May 10, 2026 05:024,12951,744,02733,125,0001,153,0002,478,080
4May 10, 2026 05:024,14251,299,42233,307,0001,074,0002,482,176
5May 10, 2026 05:024,15050,427,64333,357,0001,090,0002,478,080
6May 10, 2026 05:024,16949,729,68433,506,0001,102,0002,482,176
7May 10, 2026 05:024,17350,011,32133,562,0001,075,0002,486,272
8May 10, 2026 05:024,17949,530,43233,566,0001,125,0002,486,272
9May 10, 2026 05:024,18652,163,39433,697,0001,054,0002,473,984