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 06:03Victor MerckléVictor MerckléScore: 4,275Success
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 06:034,23743,496,24334,134,0001,038,0002,117,632stderr
2Aug 27, 2026 06:034,23843,534,26934,031,0001,151,0002,117,632stderr
3Aug 27, 2026 06:034,25743,641,98934,220,0001,115,0002,117,632stderr
4Aug 27, 2026 06:034,27443,731,23134,355,0001,121,0002,117,632stderr
5Aug 27, 2026 06:034,27543,832,97434,335,0001,153,0002,117,632stderr
6Aug 27, 2026 06:034,27943,810,62134,438,0001,078,0002,117,632stderr
7Aug 27, 2026 06:034,29043,990,42234,501,0001,113,0002,117,632stderr
8Aug 27, 2026 06:034,29843,971,93334,559,0001,117,0002,117,632stderr
9Aug 27, 2026 06:034,29943,983,49434,660,0001,022,0002,117,632stderr