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 01:37Victor MerckléVictor MerckléScore: 3,774Success
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 01:373,74939,382,93829,957,0001,167,0002,117,632stderr
2Aug 27, 2026 01:373,75139,530,12729,997,0001,142,0002,117,632stderr
3Aug 27, 2026 01:373,75539,351,94829,956,0001,218,0002,117,632stderr
4Aug 27, 2026 01:373,77039,592,01430,130,0001,169,0002,117,632stderr
5Aug 27, 2026 01:373,77439,481,47230,200,0001,127,0002,117,632stderr
6Aug 27, 2026 01:373,78239,668,58930,286,0001,110,0002,117,632stderr
7Aug 27, 2026 01:373,79539,650,10030,435,0001,064,0002,117,632stderr
8Aug 27, 2026 01:373,79940,640,69230,398,0001,140,0002,117,632stderr
9Aug 27, 2026 01:373,81339,855,09730,533,0001,119,0002,117,632stderr