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 25, 2026 22:38Victor MerckléVictor MerckléScore: 9,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:408,94481,768,80373,065,0001,176,0002,117,632stderr
2Jun 25, 2026 22:408,94781,743,97173,198,0001,065,0002,117,632stderr
3Jun 25, 2026 22:408,97483,614,97673,331,0001,157,0002,117,632stderr
4Jun 25, 2026 22:408,97481,963,98473,328,0001,157,0002,117,632stderr
5Jun 25, 2026 22:409,00182,195,96573,540,0001,171,0002,117,632stderr
6Jun 25, 2026 22:409,01782,340,94773,833,0001,014,0002,117,632stderr
7Jun 25, 2026 22:409,02282,370,43473,737,0001,148,0002,117,632stderr
8Jun 25, 2026 22:409,02982,401,05473,796,0001,148,0002,117,632stderr
9Jun 25, 2026 22:409,07782,902,02974,326,0001,014,0002,117,632stderr