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 listFeb 15, 2026 22:30wnwnScore: 10,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:309,348110,001,82470,538,0007,053,0002,478,080
2Feb 15, 2026 22:309,377101,589,47672,843,0004,989,0002,465,792
3Feb 15, 2026 22:309,435106,793,33772,290,0006,024,0002,453,504
4Feb 15, 2026 22:3010,979115,710,82683,118,0008,011,0002,449,408
5Feb 15, 2026 22:3011,180118,294,39484,816,0007,982,0002,473,984
6Feb 15, 2026 22:3011,260117,160,39885,506,0007,954,0002,449,408