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 19, 2026 12:29Victor MerckléVictor MerckléScore: 53,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 12:3052,087441,673,771431,282,0001,041,0002,113,536
2May 19, 2026 12:3053,106450,260,851439,782,0001,005,0002,113,536
3May 19, 2026 12:3053,121449,500,851439,860,0001,045,0002,113,536
4May 19, 2026 12:3053,124448,630,960439,899,0001,037,0002,113,536
5May 19, 2026 12:3053,135448,662,637439,865,0001,157,0002,113,536
6May 19, 2026 12:3053,147448,805,797440,087,0001,041,0002,113,536
7May 19, 2026 12:3053,150449,097,308440,141,0001,005,0002,113,536
8May 19, 2026 12:3053,191450,934,862440,440,0001,046,0002,113,536
9May 19, 2026 12:3053,206449,744,237440,590,0001,020,0002,113,536