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 12, 2026 13:00Victor MerckléVictor MerckléScore: 3,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:003,75539,578,47330,019,0001,155,0002,117,632stderr
2Aug 12, 2026 13:003,76639,693,84930,110,0001,151,0002,117,632stderr
3Aug 12, 2026 13:003,77639,878,70430,222,0001,126,0002,117,632stderr
4Aug 12, 2026 13:003,77839,782,66930,158,0001,201,0002,117,632stderr
5Aug 12, 2026 13:003,78939,840,28230,374,0001,075,0002,117,632stderr
6Aug 12, 2026 13:003,79339,773,64830,400,0001,085,0002,117,632stderr
7Aug 12, 2026 13:003,82740,162,00730,663,0001,103,0002,117,632stderr
8Aug 12, 2026 13:003,91740,982,73731,445,0001,068,0002,117,632stderr
9Aug 12, 2026 13:003,98641,533,79232,029,0001,057,0002,117,632stderr