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 29, 2025 14:37Josu San MartinJosu San MartinScore: 28,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:3728,770265,307,620236,793,0001,998,0002,273,280
2Dec 29, 2025 14:3728,845265,556,419239,412,00002,273,280
3Dec 29, 2025 14:3728,881267,734,541238,712,000998,0002,273,280
4Dec 29, 2025 14:3728,881267,479,009238,714,000998,0002,396,160
5Dec 29, 2025 14:3728,986265,826,406239,579,0001,002,0002,273,280
6Dec 29, 2025 14:3729,006260,800,135240,751,00002,387,968
7Dec 29, 2025 14:3729,046266,016,522239,081,0002,000,0002,392,064
8Dec 29, 2025 14:3729,100276,758,113240,526,0001,002,0002,396,160
9Dec 29, 2025 14:3729,101271,312,682241,542,00002,281,472