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 listApr 12, 2026 22:19Josu San MartinJosu San MartinScore: 5,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:094,93966,750,77138,995,0001,999,0002,433,024
2Apr 12, 2026 22:195,01669,667,11440,619,0001,015,0002,285,568
3Mar 10, 2026 18:095,03968,410,60739,836,0001,991,0002,424,832
4Mar 10, 2026 18:095,05366,662,89839,940,0001,997,0002,281,472
5Mar 10, 2026 18:095,05772,768,19039,979,0001,998,0002,281,472
6Mar 10, 2026 18:095,17167,921,84540,926,0001,996,0002,281,472
7Apr 12, 2026 03:175,20162,482,33741,164,0002,008,0002,428,928
8Mar 10, 2026 18:095,22466,962,60842,348,0001,008,0002,416,640
9Apr 12, 2026 03:175,24068,461,21342,481,0001,011,0002,424,832
10Apr 12, 2026 22:195,24867,999,90142,544,0001,012,0002,416,640
11Apr 12, 2026 22:195,28274,185,87441,850,0001,992,0002,285,568
12Apr 12, 2026 03:175,32063,151,73742,147,0002,007,0002,285,568