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 19:17Victor MerckléVictor MerckléScore: 4,564Success
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 19:174,52846,048,00036,485,0001,105,0002,117,632stderr
2Aug 11, 2026 19:174,54147,158,39436,583,0001,114,0002,117,632stderr
3Aug 11, 2026 19:174,55946,386,92136,820,0001,024,0002,117,632stderr
4Aug 11, 2026 19:174,56346,371,39036,767,0001,108,0002,117,632stderr
5Aug 11, 2026 19:174,56446,321,73536,758,0001,124,0002,117,632stderr
6Aug 11, 2026 19:174,58146,485,69937,001,0001,025,0002,117,632stderr
7Aug 11, 2026 19:174,72747,666,25638,057,0001,185,0002,117,632stderr
8Aug 11, 2026 19:174,83148,530,05339,068,0001,033,0002,117,632stderr
9Aug 11, 2026 19:174,87448,926,57539,411,0001,044,0002,117,632stderr