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 08:26Ham-HamHam-HamScore: 64,726Success
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 08:2564,677560,964,452535,817,000999,0002,396,160
2Nov 25, 2025 08:2664,678566,238,367535,826,000999,0002,273,280
3Nov 25, 2025 08:2564,719564,775,326536,171,0001,000,0002,273,280
4Nov 25, 2025 08:2564,726564,116,661536,229,0001,000,0002,273,280
5Nov 25, 2025 08:2664,766566,176,573535,561,0001,998,0002,400,256
6Nov 25, 2025 08:2664,769565,308,919536,583,000999,0002,404,352