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 listNov 25, 2025 09:11Ham-HamHam-HamScore: 52,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 09:1152,144457,102,784430,798,0001,999,0002,498,560
2Nov 25, 2025 09:1152,160456,352,525430,930,0001,999,0002,535,424
3Nov 25, 2025 09:1152,161460,660,319430,941,0001,999,0002,535,424
4Nov 25, 2025 09:1152,164451,120,793430,963,0001,999,0002,494,464
5Nov 25, 2025 09:1152,165459,253,589430,972,0001,999,0002,273,280
6Nov 25, 2025 09:1152,184455,109,220432,128,0001,000,0002,531,328
7Nov 25, 2025 09:1152,188452,151,867432,162,0001,000,0002,273,280
8Nov 25, 2025 09:1152,190456,176,247432,173,0001,000,0002,273,280
9Nov 25, 2025 09:1152,208460,314,572431,328,0001,996,0002,494,464