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 listJun 18, 2026 14:48Victor MerckléVictor MerckléScore: 4,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 14:494,53745,348,57336,613,0001,046,0002,113,536
2Jun 18, 2026 14:494,53745,295,23236,563,0001,097,0002,113,536
3Jun 18, 2026 14:494,54145,349,96036,681,0001,012,0002,113,536
4Jun 18, 2026 14:494,54345,311,78736,667,0001,043,0002,113,536
5Jun 18, 2026 14:494,54745,343,27136,670,0001,074,0002,113,536
6Jun 18, 2026 14:494,55045,419,05836,679,0001,094,0002,113,536
7Jun 18, 2026 14:494,55845,461,31336,804,0001,034,0002,113,536
8Jun 18, 2026 14:494,76847,226,20738,475,0001,103,0002,113,536
9Jun 18, 2026 14:494,77047,192,31238,565,0001,027,0002,113,536