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 05:30CheckHarryCheckHarryScore: 5,997Success
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 05:305,96459,358,07847,449,0002,054,0002,113,536
2Sep 3, 2026 05:305,97559,511,37247,563,0002,032,0002,113,536
3Sep 3, 2026 05:305,98959,691,88647,663,0002,053,0002,113,536
4Sep 3, 2026 05:305,99059,613,57947,661,0002,063,0002,113,536
5Sep 3, 2026 05:305,99759,609,39047,764,0002,018,0002,113,536
6Sep 3, 2026 05:305,99959,654,87547,745,0002,050,0002,113,536
7Sep 3, 2026 05:306,03260,032,63148,038,0002,029,0002,113,536
8Sep 3, 2026 05:306,27061,903,08451,023,0001,019,0002,113,536
9Sep 3, 2026 05:306,28562,046,46251,153,0001,020,0002,113,536