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 15, 2026 08:14Victor MerckléVictor MerckléScore: 4,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 08:154,55245,165,94236,731,0001,055,0002,113,536
2Jun 15, 2026 08:154,55445,226,02336,744,0001,055,0002,113,536
3Jun 15, 2026 08:154,56545,245,29336,835,0001,055,0002,113,536
4Jun 15, 2026 08:154,56845,297,10136,887,0001,033,0002,113,536
5Jun 15, 2026 08:154,57045,343,77136,860,0001,076,0002,113,536
6Jun 15, 2026 08:154,58345,422,97936,965,0001,080,0002,113,536
7Jun 15, 2026 08:154,77447,042,31938,619,0001,010,0002,113,536
8Jun 15, 2026 08:154,78147,131,36638,536,0001,147,0002,113,536
9Jun 15, 2026 08:154,82447,350,58739,003,0001,041,0002,113,536