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 27, 2026 01:28Code HintsCode HintsScore: 6,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:286,13759,972,68548,878,0002,063,0002,113,536
2Jun 27, 2026 01:286,20358,970,11248,440,0003,048,0002,113,536
3Jun 27, 2026 01:286,21559,165,10348,507,0003,082,0002,113,536
4Jun 27, 2026 01:286,26259,536,28948,935,0003,040,0002,113,536
5Jun 27, 2026 01:286,26859,601,41848,988,0003,037,0002,113,536
6Jun 27, 2026 01:286,27859,792,18049,069,0003,043,0002,113,536
7Jun 27, 2026 01:286,36660,387,30949,784,0003,057,0002,113,536
8Jun 27, 2026 01:286,45861,380,64650,575,0003,027,0002,113,536
9Jun 27, 2026 01:287,34168,634,64358,873,0002,060,0002,113,536