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 listMay 16, 2026 03:13Victor MerckléVictor MerckléScore: 52,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:1452,320443,052,684433,257,0001,003,0002,113,536
2May 16, 2026 03:1452,330442,852,743433,344,0001,003,0002,113,536
3May 16, 2026 03:1452,331444,648,574433,345,0001,005,0002,113,536
4May 16, 2026 03:1452,338444,642,983433,407,0001,004,0002,113,536
5May 16, 2026 03:1452,340444,642,510433,422,0001,004,0002,113,536
6May 16, 2026 03:1452,341442,064,189433,431,0001,006,0002,113,536
7May 16, 2026 03:1452,350443,317,430433,509,0001,004,0002,113,536
8May 16, 2026 03:1452,356442,182,946433,552,0001,005,0002,113,536
9May 16, 2026 03:1452,389442,313,343433,831,0001,004,0002,113,536