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 listApr 18, 2026 15:53Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:04Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:04043,008,97033,694,0001,120,0002,117,632expected "74600294196621100 ", got "20785990392852268 "
2Jul 7, 2026 00:04042,865,31333,880,0001,072,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 7, 2026 00:04042,747,63733,740,0001,133,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:534,29866,754,35933,695,0001,982,0002,531,328
5Apr 18, 2026 15:534,32061,611,01933,861,0001,991,0002,535,424
6Apr 18, 2026 15:534,32165,053,51234,866,000996,0002,473,984