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 14:57Victor MerckléVictor MerckléScore: 6,526Success
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 14:586,51461,663,09652,993,0001,076,0002,113,536
2Jun 10, 2026 14:586,52061,505,72953,043,0001,080,0002,113,536
3Jun 10, 2026 14:586,52061,723,98453,042,0001,082,0002,113,536
4Jun 10, 2026 14:586,52262,955,61253,053,0001,087,0002,113,536
5Jun 10, 2026 14:586,52661,586,54153,063,0001,107,0002,113,536
6Jun 10, 2026 14:586,52661,944,91153,038,0001,130,0002,113,536
7Jun 10, 2026 14:586,52761,606,79453,083,0001,093,0002,113,536
8Jun 10, 2026 14:586,53861,864,88553,199,0001,073,0002,113,536
9Jun 10, 2026 14:586,54261,707,59953,217,0001,085,0002,113,536