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 12:19Victor MerckléVictor MerckléScore: 5,306Success
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 12:195,29151,636,12842,880,0001,041,0002,113,536
2Jun 10, 2026 12:195,29351,889,25942,903,0001,029,0002,113,536
3Jun 10, 2026 12:195,29551,401,17342,920,0001,033,0002,113,536
4Jun 10, 2026 12:195,30051,599,97542,993,0001,002,0002,113,536
5Jun 10, 2026 12:195,30651,617,08643,000,0001,041,0002,113,536
6Jun 10, 2026 12:195,30951,672,36143,046,0001,026,0002,113,536
7Jun 10, 2026 12:195,44253,542,99444,137,0001,032,0002,113,536
8Jun 10, 2026 12:195,44852,773,32444,213,0001,008,0002,113,536
9Jun 10, 2026 12:195,45652,686,57144,292,0001,001,0002,113,536