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 listAug 28, 2026 05:36Victor MerckléVictor MerckléScore: 8,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:378,75580,799,87771,647,0001,023,0002,113,536
2Aug 28, 2026 05:378,77281,172,82971,797,0001,012,0002,113,536
3Aug 28, 2026 05:378,78781,378,71671,883,0001,055,0002,113,536
4Aug 28, 2026 05:378,79181,151,01071,955,0001,014,0002,113,536
5Aug 28, 2026 05:378,79881,406,18771,907,0001,118,0002,113,536
6Aug 28, 2026 05:378,81381,569,11872,037,0001,116,0002,113,536
7Aug 28, 2026 05:378,87281,892,17772,571,0001,067,0002,113,536
8Aug 28, 2026 05:378,87382,040,13472,633,0001,015,0002,113,536
9Aug 28, 2026 05:378,95082,680,59373,278,0001,007,0002,113,536