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 20, 2026 09:31Victor MerckléVictor MerckléScore: 20,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 09:3220,537178,155,665169,419,0001,040,0002,113,536
2Jun 20, 2026 09:3220,579178,450,868169,788,0001,022,0002,113,536
3Jun 20, 2026 09:3220,628178,828,345170,208,0001,007,0002,113,536
4Jun 20, 2026 09:3220,656179,106,431170,391,0001,060,0002,113,536
5Jun 20, 2026 09:3220,681179,363,946170,658,0001,002,0002,113,536
6Jun 20, 2026 09:3220,696179,865,336170,769,0001,008,0002,113,536
7Jun 20, 2026 09:3220,698179,210,331170,703,0001,092,0002,113,536
8Jun 20, 2026 09:3220,726179,465,475170,934,0001,097,0002,113,536
9Jun 20, 2026 09:3220,742179,764,807171,131,0001,030,0002,113,536