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 listDec 26, 2025 20:41hunaphuhunaphuScore: 373,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 20:41367,7163,078,350,4942,991,083,00060,960,0002,285,568
2Dec 26, 2025 20:41373,1903,119,707,1963,026,512,00070,965,0002,355,200
3Dec 26, 2025 20:41374,2123,134,609,6053,038,983,00066,977,0002,355,200