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 8, 2025 11:54luckyhwanluckyhwanScore: 46,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:5446,920412,245,659388,433,0001,001,0002,510,848
2Dec 8, 2025 11:5446,938415,814,854387,590,0001,997,0002,400,256
3Dec 8, 2025 11:5446,942415,867,447388,618,000999,0002,510,848
4Dec 9, 2025 08:3746,942416,104,717387,622,0001,998,0002,379,776
5Dec 8, 2025 11:5446,943412,894,225387,626,0001,998,0002,469,888
6Dec 8, 2025 11:5446,943414,358,127389,631,00002,510,848
7Dec 9, 2025 08:3746,943420,388,613387,632,0001,998,0002,510,848
8Dec 8, 2025 11:5446,944415,959,260387,635,0001,998,0002,387,968
9Dec 8, 2025 11:5446,944419,748,989387,640,0001,998,0002,387,968
10Dec 9, 2025 08:3746,950415,974,673388,683,000999,0002,371,584
11Dec 8, 2025 11:5446,953419,673,270387,714,0001,998,0002,510,848
12Dec 8, 2025 11:5446,968418,040,499387,837,0001,999,0002,510,848