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 listOct 11, 2025 19:04Serge SmirnovSerge SmirnovScore: 63,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 19:0463,372545,623,979523,986,0001,999,0002,338,816
2Oct 11, 2025 19:0463,566554,931,898523,598,0003,996,0002,371,584
3Oct 11, 2025 19:0463,570551,170,659525,633,0001,998,0002,473,984
4Oct 11, 2025 19:0463,614559,732,805524,998,0002,999,0002,469,888
5Oct 11, 2025 19:0464,450568,611,436532,939,0001,999,0002,461,696
6Oct 11, 2025 19:0464,502562,076,205535,369,00002,375,680