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 16:27Victor MerckléVictor MerckléScore: 4,551Success
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 16:284,52445,174,40436,474,0001,079,0002,113,536
2Jun 25, 2026 16:284,52745,561,18336,487,0001,095,0002,113,536
3Jun 25, 2026 16:284,53045,228,77736,497,0001,104,0002,113,536
4Jun 25, 2026 16:284,54245,178,85636,696,0001,010,0002,113,536
5Jun 25, 2026 16:284,55145,402,35336,681,0001,100,0002,113,536
6Jun 25, 2026 16:284,56245,454,00836,831,0001,035,0002,113,536
7Jun 25, 2026 16:284,57245,438,95536,922,0001,027,0002,113,536
8Jun 25, 2026 16:284,60945,857,64637,134,0001,122,0002,113,536
9Jun 25, 2026 16:284,67146,371,87537,634,0001,141,0002,113,536