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,980Success
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,97559,471,54948,548,0001,046,0002,113,536
2Sep 3, 2026 01:145,97659,494,41848,552,0001,050,0002,113,536
3Sep 3, 2026 01:145,97759,545,78548,570,0001,043,0002,113,536
4Sep 3, 2026 01:145,98059,596,62748,592,0001,042,0002,113,536
5Sep 3, 2026 01:145,98060,233,81348,593,0001,048,0002,113,536
6Sep 3, 2026 01:145,98359,591,66348,606,0001,057,0002,113,536
7Sep 3, 2026 01:145,98459,512,62748,621,0001,049,0002,113,536
8Sep 3, 2026 01:145,99259,573,65148,573,0001,163,0002,113,536
9Sep 3, 2026 01:146,03273,917,24648,944,0001,124,0002,117,632