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 listAug 20, 2026 22:21Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:50Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:53011,239,7061,354,000020,480No answer to stdout. Died or killed?
2Aug 20, 2026 22:226,25461,731,09750,801,0001,114,0002,113,536
3Aug 20, 2026 22:226,26161,719,95850,838,0001,130,0002,113,536
4Aug 20, 2026 22:226,26861,947,34650,896,0001,131,0002,113,536
5Aug 20, 2026 22:226,36262,641,20351,669,0001,138,0002,113,536
6Aug 20, 2026 22:226,37062,654,15851,739,0001,132,0002,113,536
7Aug 20, 2026 22:226,42563,226,27752,217,0001,117,0002,113,536
8Aug 20, 2026 22:226,42663,163,35252,197,0001,145,0002,113,536
9Aug 20, 2026 22:226,43663,180,54052,295,0001,127,0002,113,536
10Aug 20, 2026 22:226,47663,582,85352,614,0001,137,0002,113,536