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 8, 2026 11:15Victor MerckléVictor MerckléScore: 4,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 11:204,71247,904,19234,359,0004,753,00024,576stderr
2Sep 8, 2026 11:204,72847,869,36034,240,0005,007,00024,576stderr
3Sep 8, 2026 11:204,84948,737,21434,121,0006,128,00024,576stderr
4Sep 8, 2026 11:204,87648,963,40434,054,0006,420,00024,576stderr
5Sep 8, 2026 11:204,89249,067,47334,955,0005,656,0002,117,632stderr
6Sep 8, 2026 11:204,89349,114,48934,453,0006,165,0002,117,632stderr
7Sep 8, 2026 11:204,93150,035,30734,223,0006,711,0002,117,632stderr
8Sep 8, 2026 11:205,01050,112,78634,763,0006,826,00024,576stderr
9Sep 8, 2026 11:205,10850,914,01233,997,0008,401,00024,576stderr