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 listFeb 12, 2026 17:50CheckHarryCheckHarryScore: 56,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 17:5056,599495,619,530467,772,0001,999,0002,281,472
2Feb 12, 2026 17:5056,605495,325,801468,821,000999,0002,285,568
3Feb 12, 2026 17:5056,606497,292,708467,829,0001,999,0002,285,568
4Feb 12, 2026 17:5056,610491,544,794467,861,0001,999,0002,289,664
5Feb 12, 2026 17:5056,615494,524,752467,903,0001,999,0002,355,200
6Feb 12, 2026 17:5056,618492,233,385467,933,0001,999,0002,514,944
7Feb 12, 2026 17:5056,632493,743,532469,046,0001,000,0002,285,568
8Feb 12, 2026 17:5056,650494,789,656469,192,0001,000,0002,265,088
9Feb 12, 2026 17:5056,664495,668,351469,313,0001,000,0002,281,472