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 listOct 1, 2026 07:06Karthik ReddyKarthik ReddyScore: 3,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 07:073,38336,963,03426,988,0001,099,0002,113,536
2Oct 1, 2026 07:073,39237,197,44727,047,0001,113,0002,113,536
3Oct 1, 2026 07:073,39837,290,38127,047,0001,162,0002,113,536
4Oct 1, 2026 07:073,39937,207,45327,058,0001,161,0002,113,536
5Oct 1, 2026 07:073,40337,165,12427,078,0001,170,0002,113,536
6Oct 1, 2026 07:073,41037,439,03227,295,0001,011,0002,113,536
7Oct 1, 2026 07:073,41237,332,30227,153,0001,173,0002,113,536
8Oct 1, 2026 07:073,41637,366,61427,200,0001,161,0002,113,536
9Oct 1, 2026 07:073,42637,457,51227,314,0001,124,0002,113,536