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 27, 2026 16:54Victor MerckléVictor MerckléScore: 3,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:553,76839,659,20930,080,0001,196,0002,113,536
2Aug 27, 2026 16:553,77539,696,92630,108,0001,231,0002,113,536
3Aug 27, 2026 16:553,80539,960,01230,415,0001,172,0002,113,536
4Aug 27, 2026 16:553,82540,798,80130,580,0001,169,0002,113,536
5Aug 27, 2026 16:553,84740,315,71830,822,0001,115,0002,113,536
6Aug 27, 2026 16:553,91340,886,41831,278,0001,205,0002,113,536
7Aug 27, 2026 16:553,94841,194,27131,663,0001,113,0002,113,536
8Aug 27, 2026 16:553,99741,552,46032,002,0001,181,0002,113,536
9Aug 27, 2026 16:554,04641,997,63332,428,0001,159,0002,113,536