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 10:19Ham-HamHam-HamScore: 54,205Success
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 10:1854,119475,160,375448,191,0001,000,0002,273,280
2Nov 25, 2025 10:1854,169472,408,727448,603,000999,0002,535,424
3Nov 25, 2025 10:1954,192472,158,916447,795,0001,999,0002,535,424
4Nov 25, 2025 10:1854,205472,816,539447,899,0001,999,0002,273,280
5Nov 25, 2025 10:1954,286476,017,886449,578,000999,0002,273,280
6Nov 25, 2025 10:1954,287479,259,637448,588,0001,998,0002,527,232