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 11, 2026 16:42Victor MerckléVictor MerckléScore: 6,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:436,72664,077,44754,722,0001,112,0002,117,632stderr
2Aug 11, 2026 16:436,73864,277,26654,854,0001,079,0002,117,632stderr
3Aug 11, 2026 16:436,73964,355,34954,804,0001,130,0002,117,632stderr
4Aug 11, 2026 16:436,74164,357,75754,879,0001,075,0002,117,632stderr
5Aug 11, 2026 16:436,74164,163,53054,870,0001,083,0002,117,632stderr
6Aug 11, 2026 16:436,77764,438,52455,234,0001,022,0002,117,632stderr
7Aug 11, 2026 16:436,78964,550,52455,255,0001,096,0002,117,632stderr
8Aug 11, 2026 16:436,95065,916,11156,674,0001,011,0002,117,632stderr
9Aug 11, 2026 16:436,96165,955,94156,767,0001,014,0002,117,632stderr