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 listNov 25, 2025 09:18Ham-HamHam-HamScore: 52,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 09:1852,135462,461,379430,726,0001,998,0002,535,424
2Nov 25, 2025 09:1852,143459,824,261430,786,0001,999,0002,273,280
3Nov 25, 2025 09:1852,157457,365,813430,907,0001,999,0002,535,424
4Nov 25, 2025 09:1852,178456,956,681432,080,0001,000,0002,273,280
5Nov 25, 2025 09:1852,186460,279,269432,140,0001,000,0002,490,368
6Nov 25, 2025 09:1852,193453,098,492432,205,0001,000,0002,494,464
7Nov 25, 2025 09:1852,203456,819,056432,282,0001,000,0002,486,272
8Nov 25, 2025 09:1852,204458,879,045432,294,0001,000,0002,527,232
9Nov 25, 2025 09:1852,210459,719,361432,346,0001,000,0002,498,560