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 27, 2025 04:15Tan Lip WeiTan Lip WeiScore: 32,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 04:1532,580302,260,178269,417,0001,001,0002,285,568
2Oct 27, 2025 04:1532,613298,150,132268,693,0001,997,0002,265,088
3Oct 27, 2025 04:1432,615300,656,796268,704,0001,997,0002,285,568
4Oct 27, 2025 04:1432,616296,858,552268,712,0001,997,0002,285,568
5Oct 27, 2025 04:1532,618297,790,404268,733,0001,998,0002,273,280
6Oct 27, 2025 04:1432,644298,816,945268,944,0001,999,0002,347,008
7Oct 27, 2025 04:1432,655293,912,732269,035,0002,000,0002,351,104
8Oct 27, 2025 04:1532,656297,574,651269,043,0002,000,0002,277,376
9Oct 27, 2025 04:1432,662296,647,869269,093,0002,000,0002,383,872
10Oct 27, 2025 04:1532,663292,600,919269,105,0002,000,0002,260,992
11Oct 27, 2025 04:1432,672293,838,964269,180,0002,001,0002,523,136
12Oct 27, 2025 04:1432,676292,646,182270,213,0001,000,0002,363,392
13Oct 27, 2025 04:1532,680293,258,537269,245,0002,001,0002,260,992
14Oct 27, 2025 04:1532,681298,720,437269,255,0002,001,0002,285,568
15Oct 27, 2025 04:1532,690295,634,563271,325,00002,523,136
16Oct 27, 2025 04:1432,697294,916,609270,385,0001,001,0002,285,568
17Oct 27, 2025 04:1532,699301,876,365270,397,0001,001,0002,510,848
18Oct 27, 2025 04:1432,708309,977,868270,477,000998,0002,260,992