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:27Victor MerckléVictor MerckléScore: 5,985Success
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:295,96557,650,83148,406,0001,108,0002,117,632stderr
2Aug 10, 2026 16:295,96657,797,77048,425,0001,093,0002,117,632stderr
3Aug 10, 2026 16:295,96857,775,03148,412,0001,129,0002,117,632stderr
4Aug 10, 2026 16:295,98157,835,99448,534,0001,110,0002,117,632stderr
5Aug 10, 2026 16:295,98557,890,76148,573,0001,108,0002,117,632stderr
6Aug 10, 2026 16:296,02158,391,99048,946,0001,031,0002,117,632stderr
7Aug 10, 2026 16:296,02759,834,37648,971,0001,060,0002,117,632stderr
8Aug 10, 2026 16:296,04658,431,62649,170,0001,018,0002,117,632stderr
9Aug 10, 2026 16:296,07558,551,44649,400,0001,023,0002,117,632stderr