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 4, 2026 12:37Joel ChongJoel ChongScore: 62,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:3762,194526,004,454515,211,0001,006,0002,113,536
2Jul 4, 2026 12:3762,196526,427,037515,229,0001,004,0002,113,536
3Jul 4, 2026 12:3762,218526,541,251514,409,0002,008,0002,113,536
4Jul 4, 2026 12:3762,219526,504,720514,386,0002,039,0002,113,536
5Jul 4, 2026 12:3762,231526,610,566514,485,0002,037,0002,113,536
6Jul 4, 2026 12:3762,242526,708,499515,610,0001,004,0002,113,536
7Jul 4, 2026 12:3762,244528,109,891515,624,0001,005,0002,113,536
8Jul 4, 2026 12:3762,246526,852,787514,471,0002,177,0002,113,536
9Jul 4, 2026 12:3762,250526,310,660515,677,0001,006,0002,113,536