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 24, 2026 18:54Victor MerckléVictor MerckléScore: 8,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:558,75880,300,05671,616,0001,080,0002,113,536
2Jun 24, 2026 18:558,76780,437,59471,701,0001,072,0002,113,536
3Jun 24, 2026 18:558,77080,706,90371,677,0001,114,0002,113,536
4Jun 24, 2026 18:558,77380,623,88471,740,0001,078,0002,113,536
5Jun 24, 2026 18:558,81880,864,54672,152,0001,041,0002,113,536
6Jun 24, 2026 18:558,86181,226,06172,540,0001,008,0002,113,536
7Jun 24, 2026 18:558,87581,685,50172,658,0001,007,0002,113,536
8Jun 24, 2026 18:559,07482,958,57174,241,0001,081,0002,113,536
9Jun 24, 2026 18:559,07682,979,38174,238,0001,093,0002,113,536