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 listMar 18, 2026 19:42wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:45056,050,30934,419,00013,535,0002,113,536expected "74600294196621100 ", got "73555811096384556 "
2Jul 6, 2026 21:45051,957,90531,730,00012,005,0002,113,536expected "74600294196621100 ", got "73935105538017580 "
3Jul 6, 2026 21:45049,552,07232,113,0009,335,00020,480expected "74600294196621100 ", got "73948093645860140 "
4Mar 18, 2026 19:424,23554,984,97533,141,0002,008,0002,273,280
5Mar 18, 2026 19:454,23856,337,26933,164,0002,009,0002,486,272
6Mar 18, 2026 19:454,24464,224,17833,214,0002,013,0002,273,280
7Mar 18, 2026 19:424,24555,667,78233,223,0002,013,0002,273,280
8Mar 18, 2026 19:454,27456,984,84734,465,0001,013,0002,273,280
9Mar 18, 2026 19:424,32559,335,10933,902,0001,994,0002,273,280