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 listDec 19, 2025 20:07Zhalgas KhassenovZhalgas KhassenovScore: 1,829,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 20:071,827,38419,255,383,14714,467,896,000699,391,000117,846,016
2Dec 19, 2025 20:071,829,76419,788,300,72414,465,047,000721,997,000104,534,016
3Dec 19, 2025 20:071,888,31020,158,501,36714,438,272,0001,234,697,000511,750,144