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 04:36CheckHarryCheckHarryScore: 8,399Success
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 04:368,39179,479,63168,643,0001,004,0002,113,536
2Sep 3, 2026 04:368,39679,585,09968,511,0001,184,0002,113,536
3Sep 3, 2026 04:368,39879,652,35968,700,0001,006,0002,113,536
4Sep 3, 2026 04:368,39979,588,43368,662,0001,056,0002,113,536
5Sep 3, 2026 04:368,39979,557,40468,654,0001,059,0002,113,536
6Sep 3, 2026 04:368,39979,575,11868,673,0001,045,0002,113,536
7Sep 3, 2026 04:368,39979,670,50968,654,0001,059,0002,113,536
8Sep 3, 2026 04:368,40379,567,85268,703,0001,050,0002,113,536
9Sep 3, 2026 04:368,40579,654,03868,711,0001,052,0002,113,536