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 listSep 24, 2026 19:53Karthik ReddyKarthik ReddyScore: 27,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:5427,712240,548,903229,002,0001,008,0002,113,536
2Sep 24, 2026 19:5427,720241,239,321228,031,0002,053,0002,113,536
3Sep 24, 2026 19:5427,735240,647,430229,195,0001,008,0002,113,536
4Sep 24, 2026 19:5427,744240,624,744229,268,0001,009,0002,113,536
5Sep 24, 2026 19:5427,749240,840,836228,282,0002,042,0002,113,536
6Sep 24, 2026 19:5427,800241,120,705229,734,0001,009,0002,113,536
7Sep 24, 2026 19:5428,090243,626,201232,142,0001,009,0002,113,536
8Sep 24, 2026 19:5428,107243,683,672232,251,0001,040,0002,113,536
9Sep 24, 2026 19:5428,116243,844,873232,357,0001,009,0002,113,536