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 11, 2026 14:43Victor MerckléVictor MerckléScore: 9,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:449,47587,103,99975,172,0003,474,0002,117,632stderr
2Aug 11, 2026 14:449,49787,319,86475,795,0003,033,0002,117,632stderr
3Aug 11, 2026 14:449,50687,305,22775,417,0003,485,0002,117,632stderr
4Aug 11, 2026 14:449,52287,631,24475,877,0003,163,0002,117,632stderr
5Aug 11, 2026 14:449,53087,531,25075,916,0003,190,0002,117,632stderr
6Aug 11, 2026 14:449,54587,610,98376,188,0003,037,0002,117,632stderr
7Aug 11, 2026 14:449,55787,778,80176,109,0003,218,0002,117,632stderr
8Aug 11, 2026 14:449,65888,699,49877,124,0003,045,0002,117,632stderr
9Aug 11, 2026 14:449,68488,770,10577,312,0003,069,0002,117,632stderr