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 20:45boop34boop34Score: 20,179Success
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 20:4619,889175,120,443162,882,0002,199,0002,113,536
2Jul 30, 2026 20:4619,904175,951,317163,163,0002,047,0002,113,536
3Jul 30, 2026 20:4620,000176,817,243163,811,0002,194,0002,113,536
4Jul 30, 2026 20:4620,088177,526,450164,525,0002,208,0002,113,536
5Jul 30, 2026 20:4620,179177,510,140165,442,0002,046,0002,113,536
6Jul 30, 2026 20:4620,179177,468,058165,442,0002,045,0002,113,536
7Jul 30, 2026 20:4620,270178,420,405166,208,0002,041,0002,113,536
8Jul 30, 2026 20:4620,466179,926,167167,799,0002,077,0002,113,536
9Jul 30, 2026 20:4620,605181,900,305169,014,0002,014,0002,113,536