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 05:05Victor MerckléVictor MerckléScore: 77,890Success
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 05:0677,069648,165,956634,288,0005,392,0002,117,632stderr
2Aug 12, 2026 05:0677,101648,349,206634,607,0005,334,0002,117,632stderr
3Aug 12, 2026 05:0677,113648,472,201634,436,0005,604,0002,117,632stderr
4Aug 12, 2026 05:0677,474651,555,108637,447,0005,595,0002,117,632stderr
5Aug 12, 2026 05:0677,890655,146,870640,753,0005,736,0002,117,632stderr
6Aug 12, 2026 05:0677,976655,761,781641,149,0006,056,0002,117,632stderr
7Aug 12, 2026 05:0677,988655,756,623642,014,0005,292,0002,117,632stderr
8Aug 12, 2026 05:0678,055656,527,961641,697,0006,160,0002,117,632stderr
9Aug 12, 2026 05:0678,068656,534,332642,363,0005,609,0002,117,632stderr