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 listDec 22, 2025 19:22Mark R BestMark R BestScore: 56,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:2256,094490,780,228413,626,00051,953,0002,301,952
2Dec 22, 2025 19:2256,126491,598,324407,867,00057,981,0002,301,952
3Dec 22, 2025 19:2256,233495,528,139407,769,00058,966,0002,289,664
4Dec 22, 2025 19:2256,246496,531,561402,861,00063,978,0002,293,760
5Dec 22, 2025 19:2256,342499,140,489413,679,00053,958,0002,289,664
6Dec 22, 2025 19:2256,344493,650,022413,693,00053,959,0002,285,568
7Dec 22, 2025 19:2256,407488,900,619420,160,00048,018,0002,437,120
8Dec 22, 2025 19:2256,441501,279,925418,414,00050,049,0002,297,856
9Dec 22, 2025 19:2256,496496,226,637410,926,00057,989,0002,277,376