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 06:47Victor MerckléVictor MerckléScore: 4,376Success
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 06:524,07742,163,77329,655,0004,188,0002,117,632stderr
2Sep 8, 2026 06:524,08942,184,40929,830,0004,115,00024,576stderr
3Sep 8, 2026 06:524,10242,496,26429,613,0004,438,00024,576stderr
4Sep 8, 2026 06:524,33344,519,53129,630,0006,341,00024,576stderr
5Sep 8, 2026 06:524,37644,850,22529,568,0006,757,0002,117,632stderr
6Sep 8, 2026 06:524,46345,386,61929,610,0007,440,0002,117,632stderr
7Sep 8, 2026 06:524,61946,788,75929,814,0008,531,00024,576stderr
8Sep 8, 2026 06:524,69848,192,65530,299,0008,695,00024,576stderr
9Sep 8, 2026 06:524,74248,833,12730,007,0009,358,00024,576stderr