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 8, 2025 11:15luckyhwanluckyhwanScore: 80,163Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:1580,151687,753,815663,250,0002,000,0002,523,136
2Dec 8, 2025 11:1580,159694,801,029665,323,00002,519,040
3Dec 8, 2025 11:1580,161691,345,150665,338,00002,375,680
4Dec 8, 2025 11:1580,162693,004,020664,346,0001,000,0002,260,992
5Dec 8, 2025 11:1580,163689,483,318662,354,0003,001,0002,519,040
6Dec 8, 2025 11:1580,164691,710,944664,360,0001,000,0002,519,040
7Dec 8, 2025 11:1580,170694,200,445664,413,0001,000,0002,383,872
8Dec 8, 2025 11:1580,172692,980,362661,434,0003,996,0002,256,896
9Dec 8, 2025 11:1580,181693,502,433662,508,0002,997,0002,519,040