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 listOct 17, 2025 13:48RyogaRyogaScore: 50,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 13:4850,421445,047,223418,498,00002,482,176
2Oct 17, 2025 13:4850,435442,723,164415,617,0002,997,0002,523,136
3Oct 17, 2025 13:4850,439443,740,296417,648,000999,0002,482,176
4Oct 17, 2025 13:4850,439446,802,565417,646,000999,0002,478,080
5Oct 17, 2025 13:4850,440444,614,701417,654,000999,0002,265,088
6Oct 17, 2025 13:4850,442439,601,203417,668,000999,0002,523,136
7Oct 17, 2025 13:4850,447446,466,352417,713,000999,0002,482,176
8Oct 17, 2025 13:4850,461438,875,630416,827,0001,999,0002,482,176
9Oct 17, 2025 13:4850,569440,426,626415,724,0003,997,0002,478,080