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 24, 2026 22:45Victor MerckléVictor MerckléScore: 4,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:464,04841,983,44232,577,0001,029,0002,117,632stderr
2Aug 24, 2026 22:464,05141,989,84632,600,0001,025,0002,117,632stderr
3Aug 24, 2026 22:464,05942,066,32832,656,0001,039,0002,117,632stderr
4Aug 24, 2026 22:464,05942,052,85532,687,0001,010,0002,117,632stderr
5Aug 24, 2026 22:464,06942,163,52632,749,0001,031,0002,117,632stderr
6Aug 24, 2026 22:464,09342,641,56732,966,0001,009,0002,117,632stderr
7Aug 24, 2026 22:464,11243,239,84633,035,0001,099,0002,117,632stderr
8Aug 24, 2026 22:464,12842,683,35233,168,0001,099,0002,117,632stderr
9Aug 24, 2026 22:464,13642,820,30633,225,0001,112,0002,117,632stderr