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 14:43Victor MerckléVictor MerckléScore: 4,538Success
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 14:494,50646,435,24832,737,0004,665,00024,576stderr
2Sep 8, 2026 14:494,50946,538,28732,779,0004,650,00024,576stderr
3Sep 8, 2026 14:494,51146,526,84832,825,0004,619,00024,576stderr
4Sep 8, 2026 14:494,51846,036,86532,724,0004,783,00024,576stderr
5Sep 8, 2026 14:494,53846,156,71332,940,0004,726,00024,576stderr
6Sep 8, 2026 14:494,56146,962,72233,212,0004,651,00024,576stderr
7Sep 8, 2026 14:494,61246,789,22132,739,0005,544,00024,576stderr
8Sep 8, 2026 14:494,66747,864,11332,960,0005,782,0002,117,632stderr
9Sep 8, 2026 14:494,76647,996,59432,094,0007,470,00024,576stderr