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 13, 2026 18:48boop34boop34Score: 20,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 18:4920,489180,353,208169,054,0001,011,0002,113,536
2Jul 13, 2026 18:4920,941183,590,285172,802,0001,011,0002,113,536
3Jul 13, 2026 18:4920,947183,491,348172,857,0001,009,0002,113,536
4Jul 13, 2026 18:4920,954184,952,040172,911,0001,010,0002,113,536
5Jul 13, 2026 18:4920,955184,007,859172,920,0001,009,0002,113,536
6Jul 13, 2026 18:4920,958183,657,117172,941,0001,011,0002,113,536
7Jul 13, 2026 18:4920,964184,071,226172,996,0001,011,0002,113,536
8Jul 13, 2026 18:4920,967184,299,493172,024,0002,010,0002,113,536
9Jul 13, 2026 18:4920,969184,365,979172,000,0002,050,0002,113,536