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 19:47Victor MerckléVictor MerckléScore: 5,350Success
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 19:485,33451,790,35743,195,0001,085,0002,113,536
2Jun 25, 2026 19:485,33651,917,52343,210,0001,081,0002,113,536
3Jun 25, 2026 19:485,34052,295,66643,210,0001,118,0002,113,536
4Jun 25, 2026 19:485,34352,253,17043,239,0001,112,0002,113,536
5Jun 25, 2026 19:485,35051,971,47043,293,0001,114,0002,113,536
6Jun 25, 2026 19:485,36252,666,52343,498,0001,011,0002,113,536
7Jun 25, 2026 19:485,39052,758,88543,625,0001,115,0002,113,536
8Jun 25, 2026 19:485,40052,921,62243,739,0001,086,0002,113,536
9Jun 25, 2026 19:485,44452,691,19544,076,0001,111,0002,113,536