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 21:22Adam FolwarcznyAdam FolwarcznyScore: 10,282Success
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 21:2210,077109,202,59546,250,00037,393,0002,387,968
2Aug 30, 2025 21:2210,277110,830,73048,042,00037,257,0002,441,216
3Aug 30, 2025 21:2210,282109,070,87451,990,00033,352,0002,478,080
4Aug 30, 2025 21:2210,282109,664,14153,951,00031,390,0002,449,408
5Aug 30, 2025 21:2210,319110,449,00145,287,00040,364,0002,502,656
6Aug 30, 2025 21:2210,651117,539,17647,677,00040,724,0002,510,848