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 19, 2026 05:25Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:49050,670,58841,588,0001,104,0002,117,632expected "74600294196621100 ", got "21355935138754348 "
2Jul 7, 2026 04:49050,791,82241,603,0001,072,0002,117,632expected "74600294196621100 ", got "21355935138754348 "
3Jul 7, 2026 04:49050,481,52641,495,0001,084,0002,117,632expected "74600294196621100 ", got "21355935138754348 "
4Apr 19, 2026 05:255,29766,874,96341,968,0001,998,0002,473,984
5Apr 19, 2026 05:255,34865,311,38443,380,0001,008,0002,269,184
6Apr 19, 2026 05:255,46064,227,64644,311,0001,007,0002,482,176