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 listSep 25, 2025 07:54Wookyung JeongWookyung JeongScore: 65,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 07:5465,191565,066,938540,082,0001,000,0002,510,848
2Sep 25, 2025 07:5465,193569,647,132541,104,00002,519,040
3Sep 25, 2025 07:5465,204566,757,482539,196,0002,000,0002,256,896
4Sep 25, 2025 07:5465,204566,552,859541,191,00002,256,896
5Sep 25, 2025 07:5465,218567,096,916539,307,0002,001,0002,519,040
6Sep 25, 2025 07:5465,220573,191,049541,322,00002,392,064
7Sep 25, 2025 07:5465,220571,302,094541,323,00002,519,040
8Sep 25, 2025 07:5465,242567,594,281539,509,0001,998,0002,265,088
9Sep 25, 2025 07:5465,249567,681,311539,568,0001,998,0002,519,040