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 9, 2026 23:00Josu San MartinJosu San MartinScore: 4,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:004,74757,446,94138,374,0001,029,0002,371,584
2May 9, 2026 23:004,76354,566,65638,353,0001,180,0002,387,968
3May 9, 2026 23:004,77258,167,60238,577,0001,036,0002,383,872
4May 9, 2026 23:004,77758,381,68338,449,0001,201,0002,379,776
5May 9, 2026 23:004,81556,506,68538,947,0001,024,0002,363,392
6May 9, 2026 23:004,84255,473,13639,008,0001,185,0002,375,680
7May 9, 2026 23:004,86557,231,96239,345,0001,040,0002,375,680
8May 9, 2026 23:004,88057,857,80639,314,0001,196,0002,379,776
9May 9, 2026 23:005,07958,504,48741,112,0001,044,0002,367,488