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 18:35hunaphuhunaphuScore: 61,664Success
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 18:3561,299535,606,678506,786,0001,999,0002,404,352
2Dec 26, 2025 18:3561,307531,784,609505,848,0002,999,0002,269,184
3Dec 26, 2025 18:3561,310532,055,887506,878,0001,999,0002,269,184
4Dec 26, 2025 18:3561,326534,952,653506,004,0003,000,0002,269,184
5Dec 26, 2025 18:3561,664533,893,903509,816,0001,999,0002,269,184
6Dec 26, 2025 18:3561,761542,695,069511,620,000999,0002,269,184
7Dec 26, 2025 18:3562,758546,541,543518,892,0001,999,0002,269,184
8Dec 26, 2025 18:3564,630565,865,588536,431,00002,269,184
9Dec 26, 2025 18:3564,631562,840,088533,439,0002,996,0002,269,184