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 15, 2025 12:45Pavitra GolchhaPavitra GolchhaScore: 157,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 12:45157,5071,336,883,1771,075,429,000231,876,0002,285,568
2Dec 15, 2025 12:45157,6491,335,932,1841,075,576,000232,908,0002,314,240
3Dec 15, 2025 12:45157,6791,342,859,0401,075,959,000232,774,0002,269,184
4Dec 15, 2025 12:45157,8351,341,036,4471,077,202,000232,827,0002,506,752
5Dec 15, 2025 12:45157,8451,340,693,0871,075,271,000234,840,0002,478,080
6Dec 15, 2025 12:45157,9771,333,224,5251,079,347,000231,859,0002,510,848
7Dec 15, 2025 12:45158,2661,341,428,6341,080,677,000232,930,0002,510,848
8Dec 15, 2025 12:45158,5511,345,134,9361,081,160,000234,817,0002,351,104
9Dec 15, 2025 12:45158,9781,349,272,2401,081,784,000237,732,0002,502,656