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 29, 2026 07:01Victor MerckléVictor MerckléScore: 12,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 07:0212,178108,968,99399,963,0001,120,0002,117,632stderr
2Jun 29, 2026 07:0212,187108,823,311100,057,0001,100,0002,117,632stderr
3Jun 29, 2026 07:0212,205109,286,450100,297,0001,011,0002,117,632stderr
4Jun 29, 2026 07:0212,219109,303,115100,324,0001,097,0002,117,632stderr
5Jun 29, 2026 07:0212,256109,705,165100,623,0001,104,0002,117,632stderr
6Jun 29, 2026 07:0212,264109,725,459100,780,0001,017,0002,117,632stderr
7Jun 29, 2026 07:0212,280109,767,380100,880,0001,044,0002,117,632stderr
8Jun 29, 2026 07:0212,287109,918,821100,904,0001,084,0002,117,632stderr
9Jun 29, 2026 07:0212,294109,983,524101,013,0001,032,0002,117,632stderr