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:28Kevin HeaveyKevin HeaveyScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 18:313,69341,572,40629,604,0001,053,0002,138,112
2Jul 24, 2026 18:313,69941,137,69129,631,0001,076,0002,138,112
3Jul 24, 2026 18:313,71339,991,42829,666,0001,160,0002,138,112
4Jul 24, 2026 18:313,76847,765,03830,093,0001,189,0002,138,112
5Jul 24, 2026 18:313,79142,032,45530,375,0001,094,0002,138,112
6Jul 24, 2026 18:313,90543,014,27831,359,0001,059,0002,138,112
7Jul 24, 2026 18:313,94643,468,62931,679,0001,076,0002,138,112
8Jul 24, 2026 18:313,98143,368,68531,959,0001,089,0002,138,112
9Jul 24, 2026 18:313,98243,752,27531,960,0001,093,0002,138,112