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 20:27Victor MerckléVictor MerckléScore: 8,039Success
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 20:288,00774,523,22565,339,0001,125,0002,117,632stderr
2Jun 24, 2026 20:288,01574,141,85565,472,0001,057,0002,117,632stderr
3Jun 24, 2026 20:288,03274,643,75165,564,0001,109,0002,117,632stderr
4Jun 24, 2026 20:288,03874,806,36165,604,0001,114,0002,117,632stderr
5Jun 24, 2026 20:288,03974,367,76965,724,0001,003,0002,117,632stderr
6Jun 24, 2026 20:288,04074,804,47365,694,0001,043,0002,117,632stderr
7Jun 24, 2026 20:288,22776,254,38367,177,0001,114,0002,117,632stderr
8Jun 24, 2026 20:288,25176,137,50967,391,0001,100,0002,117,632stderr
9Jun 24, 2026 20:288,39977,392,96768,673,0001,039,0002,117,632stderr