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:24Ham-HamHam-HamScore: 64,736Success
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,697565,128,570535,984,000999,0002,273,280
2Nov 25, 2025 08:2564,730559,939,847536,258,0001,000,0002,273,280
3Nov 25, 2025 08:2464,731559,560,751537,267,00002,273,280
4Nov 25, 2025 08:2564,736568,019,645537,307,00002,273,280
5Nov 25, 2025 08:2464,737565,481,768536,321,000998,0002,273,280
6Nov 25, 2025 08:2464,829562,979,421537,080,0001,000,0002,273,280