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 30, 2026 15:10CodeReclaimersCodeReclaimersScore: 17,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 15:1016,581147,634,837136,465,0001,163,0002,113,536
2Jul 30, 2026 15:1016,595147,877,420136,511,0001,234,0002,113,536
3Jul 30, 2026 15:1016,596148,544,461136,510,0001,244,0002,113,536
4Jul 30, 2026 15:1016,608147,920,226136,601,0001,252,0002,113,536
5Jul 30, 2026 15:1017,946159,037,603147,796,0001,160,0002,113,536
6Jul 30, 2026 15:1017,962159,779,849147,826,0001,265,0002,113,536
7Jul 30, 2026 15:1017,965160,668,865147,870,0001,247,0002,113,536
8Jul 30, 2026 15:1017,979159,310,472148,141,0001,087,0002,113,536
9Jul 30, 2026 15:1018,605165,168,285153,166,0001,257,0002,113,536