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 27, 2026 13:45Victor MerckléVictor MerckléScore: 4,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:494,30044,892,65934,507,0001,191,0002,174,976
2Jun 27, 2026 13:494,32445,133,54734,702,0001,188,0002,174,976
3Jun 27, 2026 13:494,45346,129,23535,782,0001,178,0002,129,920
4Jun 27, 2026 13:494,45546,162,64835,807,0001,174,0002,129,920
5Jun 27, 2026 13:494,45546,272,56335,796,0001,181,0002,129,920
6Jun 27, 2026 13:494,46446,222,24535,861,0001,195,0002,129,920
7Jun 27, 2026 13:494,48946,345,03636,084,0001,182,0002,174,976
8Jun 27, 2026 13:494,73048,429,16438,073,0001,186,0002,129,920
9Jun 27, 2026 13:494,76048,662,38738,322,0001,187,0002,129,920