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 14, 2026 23:07Andrew TsibinAndrew TsibinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:39Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:40030,030,505,87530,019,199,0001,094,00016,384Killed by timeout
2Jul 14, 2026 23:075,36154,136,35943,476,0001,023,0002,113,536
3Jul 14, 2026 23:075,36354,115,02343,497,0001,022,0002,113,536
4Jul 14, 2026 23:075,38357,656,91343,663,0001,022,0002,113,536
5Jul 14, 2026 23:075,40054,421,92643,800,0001,022,0002,113,536
6Jul 14, 2026 23:075,41655,003,91943,929,0001,026,0002,113,536
7Jul 14, 2026 23:075,41754,534,47043,943,0001,023,0002,113,536
8Jul 14, 2026 23:075,42657,537,99044,020,0001,024,0002,113,536
9Jul 14, 2026 23:075,44255,420,82844,151,0001,022,0002,113,536
10Jul 14, 2026 23:075,44954,906,85444,206,0001,022,0002,113,536