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:02Josu San MartinJosu San MartinScore: 4,844Success
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:034,78154,023,93538,498,0001,192,0002,383,872
2May 9, 2026 23:034,79657,907,41638,611,0001,204,0002,375,680
3May 9, 2026 23:034,83261,434,49739,058,0001,050,0002,379,776
4May 9, 2026 23:034,83358,794,26239,091,0001,030,0002,371,584
5May 9, 2026 23:034,84459,625,79539,165,0001,045,0002,363,392
6May 9, 2026 23:034,87056,838,25539,214,0001,212,0002,367,488
7May 9, 2026 23:034,92355,081,01139,574,0001,295,0002,359,296
8May 9, 2026 23:034,95455,251,21339,844,0001,276,0002,367,488
9May 9, 2026 23:034,96655,718,05740,185,0001,035,0002,375,680