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 19, 2026 23:10olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:11Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:11047,885,63037,345,0001,028,0002,113,536expected "74600294196621100 ", got "67299885892260908 "
2Jul 7, 2026 05:11046,591,89036,088,0001,022,0002,113,536expected "74600294196621100 ", got "62034371811848748 "
3Jul 7, 2026 05:11047,136,07236,621,0001,026,0002,113,536expected "74600294196621100 ", got "55803860230259756 "
4Mar 19, 2026 23:105,58873,730,73944,365,0002,016,0002,478,080
5Mar 19, 2026 23:105,60872,956,07044,526,0002,023,0002,498,560
6Mar 19, 2026 23:105,61974,405,92544,609,0002,027,0002,318,336