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 listJul 1, 2026 21:40Code HintsCode HintsScore: 6,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 21:456,09058,236,27448,495,0002,057,0002,113,536
2Jul 1, 2026 21:456,18359,348,28148,266,0003,061,0002,113,536
3Jul 1, 2026 21:456,19259,205,37649,357,0002,044,0002,113,536
4Jul 1, 2026 21:456,20459,271,32049,452,0002,044,0002,113,536
5Jul 1, 2026 21:456,20759,470,62349,481,0002,040,0002,113,536
6Jul 1, 2026 21:456,23959,789,26449,723,0002,062,0002,113,536
7Jul 1, 2026 21:456,23959,769,26749,718,0002,068,0002,113,536
8Jul 1, 2026 21:456,25260,158,67349,826,0002,069,0002,113,536
9Jul 1, 2026 21:456,26860,265,24749,960,0002,066,0002,113,536