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 25, 2026 17:08Victor MerckléVictor MerckléScore: 11,229Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 17:0911,207101,454,71691,936,0001,090,0002,117,632stderr
2Aug 25, 2026 17:0911,214101,452,57591,985,0001,097,0002,117,632stderr
3Aug 25, 2026 17:0911,220101,491,02192,031,0001,101,0002,117,632stderr
4Aug 25, 2026 17:0911,224101,575,08492,152,0001,008,0002,117,632stderr
5Aug 25, 2026 17:0911,229101,623,14992,193,0001,009,0002,117,632stderr
6Aug 25, 2026 17:0911,237101,536,61392,272,0001,003,0002,117,632stderr
7Aug 25, 2026 17:0911,241101,672,30492,287,0001,021,0002,117,632stderr
8Aug 25, 2026 17:0911,248101,734,00592,355,0001,005,0002,117,632stderr
9Aug 25, 2026 17:0911,255101,832,94992,401,0001,020,0002,117,632stderr