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 15, 2026 08:10eldon-chungeldon-chungScore: 45,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 08:1045,010402,418,452371,587,0001,997,0002,269,184
2Mar 15, 2026 08:1045,011402,588,580371,595,0001,997,0002,289,664
3Mar 15, 2026 08:1045,016404,410,872372,631,0001,001,0002,285,568
4Mar 15, 2026 08:1045,019396,903,211371,659,0001,998,0002,285,568
5Mar 15, 2026 08:1045,027397,101,710371,727,0001,998,0002,269,184
6Mar 15, 2026 08:1045,031404,111,091371,761,0001,998,0002,265,088