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 listJul 9, 2026 20:06Victor MerckléVictor MerckléScore: 23,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 20:0723,891206,383,989197,262,0001,036,0002,117,632stderr
2Jul 9, 2026 20:0723,896206,184,636197,329,0001,011,0002,117,632stderr
3Jul 9, 2026 20:0723,914206,593,020197,482,0001,010,0002,117,632stderr
4Jul 9, 2026 20:0723,918206,449,895197,484,0001,042,0002,117,632stderr
5Jul 9, 2026 20:0723,946206,700,470197,753,0001,003,0002,117,632stderr
6Jul 9, 2026 20:0723,974207,067,138197,821,0001,164,0002,117,632stderr
7Jul 9, 2026 20:0724,096207,930,501198,919,0001,083,0002,117,632stderr
8Jul 9, 2026 20:0725,270219,399,977208,674,0001,068,0002,117,632stderr
9Jul 9, 2026 20:0726,048224,404,312214,996,0001,210,0002,117,632stderr