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 10, 2026 16:57Victor MerckléVictor MerckléScore: 4,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:594,14442,571,85933,267,0001,130,0002,117,632stderr
2Aug 10, 2026 16:594,15042,670,54433,318,0001,129,0002,117,632stderr
3Aug 10, 2026 16:594,15042,672,37833,311,0001,141,0002,117,632stderr
4Aug 10, 2026 16:594,16142,820,39833,423,0001,118,0002,117,632stderr
5Aug 10, 2026 16:594,16842,862,35133,493,0001,106,0002,117,632stderr
6Aug 10, 2026 16:594,18442,921,56833,630,0001,104,0002,117,632stderr
7Aug 10, 2026 16:594,18542,920,04533,616,0001,127,0002,117,632stderr
8Aug 10, 2026 16:594,20943,105,98033,826,0001,113,0002,117,632stderr
9Aug 10, 2026 16:594,27343,684,64134,347,0001,120,0002,117,632stderr