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 listMay 15, 2026 23:27Victor MerckléVictor MerckléScore: 6,950Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:27M-Rochat10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:276,94566,947,82056,608,0001,037,0002,113,536
2May 15, 2026 23:276,94867,863,68857,676,00002,113,536
3May 15, 2026 23:276,94966,810,81156,676,0001,002,0002,113,536
4May 15, 2026 23:276,94964,974,09856,629,0001,050,0002,113,536
5May 15, 2026 23:276,95067,365,31056,678,0001,010,0002,113,536
6May 15, 2026 23:277,00565,470,28757,137,0001,009,0002,113,536
7May 15, 2026 23:277,02466,263,76557,266,0001,041,0002,113,536
8May 15, 2026 23:277,07668,983,97157,733,0001,002,0002,113,536
9May 15, 2026 23:277,09468,029,41257,739,0001,144,0002,113,536