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:22Ham-HamHam-HamScore: 51,731Success
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:2251,653461,009,974426,720,0001,998,0002,535,424
2Nov 25, 2025 09:2251,655452,113,110426,739,0001,998,0002,494,464
3Nov 25, 2025 09:2251,664452,829,324426,809,0001,999,0002,273,280
4Nov 25, 2025 09:2251,723453,483,422427,306,0001,996,0002,523,136
5Nov 25, 2025 09:2251,731454,527,025428,366,0001,000,0002,531,328
6Nov 25, 2025 09:2251,744455,747,965427,478,0001,997,0002,273,280
7Nov 25, 2025 09:2251,766461,261,122427,657,0001,998,0002,486,272
8Nov 25, 2025 09:2251,896458,686,431428,735,0001,998,0002,273,280
9Nov 25, 2025 09:2251,967459,875,899430,326,0001,000,0002,273,280