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 listSep 16, 2026 22:46Victor MerckléVictor MerckléScore: 45,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 22:4745,609388,374,819377,558,0001,001,0002,117,632stderr
2Sep 16, 2026 22:4745,619388,539,120377,622,0001,020,0002,117,632stderr
3Sep 16, 2026 22:4745,719389,293,351378,410,0001,064,0002,117,632stderr
4Sep 16, 2026 22:4745,753390,023,192378,731,0001,022,0002,117,632stderr
5Sep 16, 2026 22:4745,754389,662,639378,761,0001,002,0002,117,632stderr
6Sep 16, 2026 22:4745,761389,655,102378,741,0001,083,0002,117,632stderr
7Sep 16, 2026 22:4745,775389,842,022378,925,0001,013,0002,117,632stderr
8Sep 16, 2026 22:4745,809390,009,135379,094,0001,125,0002,117,632stderr
9Sep 16, 2026 22:4745,899390,864,885379,857,0001,106,0002,117,632stderr