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 01:14CheckHarryCheckHarryScore: 5,979Success
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 01:145,97659,500,73148,560,0001,041,0002,113,536
2Sep 3, 2026 01:145,97759,398,15948,572,0001,043,0002,113,536
3Sep 3, 2026 01:145,97760,617,77348,551,0001,061,0002,113,536
4Sep 3, 2026 01:145,97959,486,78548,575,0001,052,0002,113,536
5Sep 3, 2026 01:145,97959,482,66348,575,0001,052,0002,113,536
6Sep 3, 2026 01:145,98059,414,33948,589,0001,051,0002,113,536
7Sep 3, 2026 01:145,98059,539,13448,585,0001,053,0002,113,536
8Sep 3, 2026 01:145,98459,537,74548,630,0001,043,0002,113,536
9Sep 3, 2026 01:146,00069,419,91848,703,0001,099,0002,113,536