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 listAug 30, 2025 20:38Adam FolwarcznyAdam FolwarcznyScore: 10,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 20:3810,123112,281,89347,447,00036,574,0002,449,408
2Aug 30, 2025 20:3810,258111,465,49846,529,00038,609,0002,408,448
3Aug 30, 2025 20:3810,295122,399,08246,161,00039,286,0002,318,336
4Aug 30, 2025 20:3810,336110,342,38049,303,00036,484,0002,502,656
5Aug 30, 2025 20:3810,354115,066,57851,366,00034,573,0002,494,464
6Aug 30, 2025 20:3810,355115,343,94155,321,00030,624,0002,519,040
7Aug 30, 2025 20:3810,368113,317,53650,444,00035,608,0002,330,624
8Aug 30, 2025 20:3810,378125,350,05148,512,00037,622,0002,326,528
9Aug 30, 2025 20:3810,417118,739,49549,127,00037,336,0002,494,464
10Aug 30, 2025 20:3810,431117,200,27750,177,00036,403,0002,502,656
11Aug 30, 2025 20:3810,650116,181,21051,647,00036,748,0002,498,560
12Aug 30, 2025 20:3810,668123,267,86448,751,00039,796,0002,473,984