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 12, 2026 03:13Victor MerckléVictor MerckléScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 03:143,77041,698,96130,124,0001,168,0002,117,632stderr
2Aug 12, 2026 03:143,77839,761,33530,272,0001,088,0002,117,632stderr
3Aug 12, 2026 03:143,78539,896,93530,336,0001,082,0002,117,632stderr
4Aug 12, 2026 03:143,78539,776,74930,363,0001,056,0002,117,632stderr
5Aug 12, 2026 03:143,79039,864,77830,358,0001,100,0002,117,632stderr
6Aug 12, 2026 03:143,79639,934,02030,358,0001,155,0002,117,632stderr
7Aug 12, 2026 03:143,80439,981,25030,378,0001,202,0002,117,632stderr
8Aug 12, 2026 03:143,81640,143,82830,603,0001,075,0002,117,632stderr
9Aug 12, 2026 03:144,00941,664,09932,195,0001,080,0002,117,632stderr