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 listMay 5, 2025 09:18parsersmailparsersmailScore: 572,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2025 09:18550,8284,600,325,0334,563,879,0007,996,0002,387,968
2May 5, 2025 09:18572,0274,779,194,1274,736,831,00010,992,0002,355,200
3May 5, 2025 09:18582,1714,860,189,0044,825,024,0006,998,0002,355,200