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 25, 2026 18:12Victor MerckléVictor MerckléScore: 4,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:134,74347,382,82638,242,0001,131,0002,113,536
2Jun 25, 2026 18:134,74646,906,35338,291,0001,101,0002,113,536
3Jun 25, 2026 18:134,75247,104,88838,351,0001,091,0002,113,536
4Jun 25, 2026 18:134,77447,105,04138,596,0001,035,0002,113,536
5Jun 25, 2026 18:134,77747,165,78338,552,0001,103,0002,113,536
6Jun 25, 2026 18:134,78147,270,11038,578,0001,105,0002,113,536
7Jun 25, 2026 18:134,92748,437,24839,884,0001,014,0002,113,536
8Jun 25, 2026 18:134,96848,983,71640,124,0001,113,0002,113,536
9Jun 25, 2026 18:135,01350,929,28740,583,0001,030,0002,113,536