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 6, 2026 08:04CheckHarryCheckHarryScore: 4,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 08:044,18344,601,31533,711,0001,008,0002,113,536
2Sep 6, 2026 08:044,18644,685,26833,733,0001,016,0002,113,536
3Sep 6, 2026 08:044,18744,624,27533,746,0001,009,0002,113,536
4Sep 6, 2026 08:044,19544,706,93733,804,0001,021,0002,113,536
5Sep 6, 2026 08:044,19544,659,30033,813,0001,011,0002,113,536
6Sep 6, 2026 08:044,19944,784,82133,844,0001,009,0002,113,536
7Sep 6, 2026 08:044,20044,733,05533,853,0001,010,0002,113,536
8Sep 6, 2026 08:044,21244,856,77733,814,0001,146,0002,113,536
9Sep 6, 2026 08:044,21344,750,25833,863,0001,112,0002,113,536