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 13, 2026 19:52Victor MerckléVictor MerckléScore: 7,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:537,85472,546,53864,186,0001,008,0002,113,536
2May 13, 2026 19:537,85672,894,12565,212,00002,113,536
3May 13, 2026 19:537,85772,524,18764,213,0001,006,0002,113,536
4May 13, 2026 19:537,86075,365,00264,212,0001,033,0002,113,536
5May 13, 2026 19:537,86072,787,59864,200,0001,039,0002,113,536
6May 13, 2026 19:537,86475,188,42364,272,0001,002,0002,113,536
7May 13, 2026 19:537,86673,930,88964,246,0001,047,0002,113,536
8May 13, 2026 19:537,86774,462,97564,257,0001,045,0002,113,536
9May 13, 2026 19:537,86875,900,89264,265,0001,042,0002,113,536