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 listAug 2, 2026 21:50TonyTonyScore: 20,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:5120,928183,884,786172,554,0001,156,0002,113,536
2Aug 2, 2026 21:5120,931183,587,066172,650,0001,082,0002,113,536
3Aug 2, 2026 21:5120,942183,757,319172,683,0001,136,0002,113,536
4Aug 2, 2026 21:5120,942183,734,931172,717,0001,107,0002,113,536
5Aug 2, 2026 21:5120,950183,692,296172,783,0001,106,0002,113,536
6Aug 2, 2026 21:5120,950183,690,709172,819,0001,072,0002,113,536
7Aug 2, 2026 21:5120,957183,818,456172,847,0001,099,0002,113,536
8Aug 2, 2026 21:5120,962183,791,887172,837,0001,153,0002,113,536
9Aug 2, 2026 21:5120,974184,172,089172,818,0001,271,0002,113,536