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 24, 2026 18:35Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 20:58Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 21:1408,917,274896,000016,384No answer to stdout. Died or killed?
2Jul 24, 2026 18:383,49537,171,41327,967,0001,042,0002,113,536
3Jul 24, 2026 18:383,51037,261,11027,970,0001,167,0002,113,536
4Jul 24, 2026 18:383,58537,888,29928,562,0001,194,0002,113,536
5Jul 24, 2026 18:383,64238,340,03929,067,0001,169,0002,113,536
6Jul 24, 2026 18:383,64338,322,62929,052,0001,192,0002,113,536
7Jul 24, 2026 18:383,69238,776,54629,431,0001,214,0002,113,536
8Jul 24, 2026 18:383,77239,410,94430,122,0001,191,0002,113,536
9Jul 24, 2026 18:383,79139,713,26030,258,0001,210,0002,113,536
10Jul 24, 2026 18:383,79739,658,93930,324,0001,198,0002,113,536