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:19luckyhwanluckyhwanScore: 80,101Success
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:1980,081690,096,597663,675,000999,0002,510,848
2Dec 8, 2025 11:1980,086697,047,940663,714,000999,0002,519,040
3Dec 8, 2025 11:1980,088694,603,132662,729,0001,999,0002,387,968
4Dec 8, 2025 11:1980,088690,043,356663,728,000999,0002,256,896
5Dec 8, 2025 11:1980,101689,362,189662,840,0001,999,0002,379,776
6Dec 8, 2025 11:1980,103691,443,597661,852,0002,999,0002,256,896
7Dec 8, 2025 11:1980,112693,698,213662,930,0001,999,0002,510,848
8Dec 8, 2025 11:1980,118688,974,037664,981,00002,256,896
9Dec 8, 2025 11:1980,129687,902,350664,074,0001,000,0002,519,040