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 listJun 4, 2025 07:32thatmagicalcatthatmagicalcatScore: 52,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 07:3252,553459,193,863435,187,0001,000,0002,461,696
2Jun 4, 2025 07:3252,565458,896,124436,288,00002,355,200
3Jun 4, 2025 07:3252,572466,458,772436,349,00002,285,568
4Jun 4, 2025 07:3252,574462,665,321435,363,0001,000,0002,359,296
5Jun 4, 2025 07:3252,622461,477,315435,761,000999,0002,277,376
6Jun 4, 2025 07:3252,662460,015,906436,096,0001,000,0002,285,568
7Jun 4, 2025 07:3252,668462,974,687435,143,0002,000,0002,277,376
8Jun 4, 2025 07:3252,739465,738,550436,737,000999,0002,285,568
9Jun 4, 2025 07:3252,915462,925,491438,193,0001,000,0002,355,200