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 listSep 3, 2026 02:39CheckHarryCheckHarryScore: 6,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 02:396,12760,722,80949,697,0001,162,0002,113,536
2Sep 3, 2026 02:396,14060,890,73049,913,0001,049,0002,113,536
3Sep 3, 2026 02:396,16961,024,58750,157,0001,050,0002,113,536
4Sep 3, 2026 02:396,17361,095,33250,203,0001,035,0002,113,536
5Sep 3, 2026 02:396,17661,138,12850,204,0001,059,0002,113,536
6Sep 3, 2026 02:396,18061,188,98350,238,0001,056,0002,113,536
7Sep 3, 2026 02:396,18161,759,20350,247,0001,062,0002,113,536
8Sep 3, 2026 02:396,19561,414,38250,244,0001,178,0002,113,536
9Sep 3, 2026 02:396,33262,438,10151,552,0001,005,0002,113,536