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 listJan 18, 2025 14:00ttmxttmxScore: 32,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2025 14:0032,283290,842,158266,948,000999,0002,351,104
2Jan 18, 2025 14:0032,288295,578,083266,994,000999,0002,269,184
3Jan 18, 2025 14:0032,291288,314,372267,014,0001,000,0002,363,392
4Jan 18, 2025 14:0032,293292,354,738266,029,0002,000,0002,289,664
5Jan 18, 2025 14:0032,293291,164,200266,031,0002,000,0002,523,136
6Jan 18, 2025 14:0032,296290,125,474266,054,0002,000,0002,265,088
7Jan 18, 2025 14:0032,299293,884,870266,084,0002,000,0002,265,088
8Jan 18, 2025 14:0032,309293,146,493266,163,0002,001,0002,289,664
9Jan 18, 2025 14:0032,312292,005,860266,186,0002,001,0002,273,280