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 2, 2026 18:14CheckHarryCheckHarryScore: 5,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:195,92559,104,55348,134,0001,047,0002,113,536
2Sep 2, 2026 18:195,92959,113,15148,167,0001,049,0002,113,536
3Sep 2, 2026 18:195,93159,096,68848,174,0001,056,0002,113,536
4Sep 2, 2026 18:195,93359,081,40148,190,0001,056,0002,113,536
5Sep 2, 2026 18:195,93359,112,32148,206,0001,044,0002,113,536
6Sep 2, 2026 18:195,93559,031,26048,216,0001,045,0002,113,536
7Sep 2, 2026 18:195,93859,221,73548,214,0001,075,0002,113,536
8Sep 2, 2026 18:195,94659,203,65248,184,0001,175,0002,113,536
9Sep 2, 2026 18:195,94759,292,70248,134,0001,230,0002,113,536