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 10, 2026 02:16Victor MerckléVictor MerckléScore: 4,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:174,88948,222,82839,555,0001,028,0002,138,112
2Jun 10, 2026 02:174,89748,345,72839,602,0001,051,0002,138,112
3Jun 10, 2026 02:174,89848,382,04039,621,0001,038,0002,138,112
4Jun 10, 2026 02:174,90248,310,42239,645,0001,045,0002,138,112
5Jun 10, 2026 02:174,90248,228,72039,661,0001,027,0002,138,112
6Jun 10, 2026 02:174,90648,417,39539,696,0001,029,0002,138,112
7Jun 10, 2026 02:174,90848,481,62139,688,0001,053,0002,138,112
8Jun 10, 2026 02:174,91048,784,48539,696,0001,064,0002,138,112
9Jun 10, 2026 02:174,91349,614,43339,692,0001,086,0002,138,112