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 12:55Victor MerckléVictor MerckléScore: 3,953Success
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 12:563,91942,039,60931,404,0001,125,0002,117,632stderr
2Aug 12, 2026 12:563,92741,001,10731,502,0001,095,0002,117,632stderr
3Aug 12, 2026 12:563,93641,120,05731,547,0001,129,0002,117,632stderr
4Aug 12, 2026 12:563,94341,549,66631,653,0001,080,0002,117,632stderr
5Aug 12, 2026 12:563,95341,297,28231,639,0001,173,0002,117,632stderr
6Aug 12, 2026 12:563,95941,311,52631,757,0001,109,0002,117,632stderr
7Aug 12, 2026 12:563,96141,337,38631,727,0001,156,0002,117,632stderr
8Aug 12, 2026 12:563,96341,305,40931,789,0001,111,0002,117,632stderr
9Aug 12, 2026 12:564,00241,635,23932,109,0001,108,0002,117,632stderr