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 13, 2025 11:38pseppsepScore: 43,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 11:3842,981384,266,164354,745,0001,998,0002,519,040
2Dec 13, 2025 11:3843,059382,639,626357,391,00002,519,040
3Dec 13, 2025 11:3843,144387,095,860357,099,0001,000,0002,510,848
4Dec 13, 2025 11:3843,153380,018,696356,167,0002,000,0002,510,848
5Dec 13, 2025 11:3843,157382,894,946358,199,00002,510,848
6Dec 13, 2025 11:3843,160387,726,611356,225,0002,001,0002,510,848
7Dec 13, 2025 11:3843,170382,065,078356,310,0002,001,0002,514,944
8Dec 13, 2025 11:3843,188387,755,099358,462,00002,510,848
9Dec 13, 2025 11:3843,959391,731,712362,861,0001,999,0002,383,872