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:06parsersmailparsersmailScore: 56,152Success
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:0656,134492,544,796464,914,000999,0002,260,992
2May 5, 2025 09:0656,143496,415,713464,989,000999,0002,527,232
3May 5, 2025 09:0656,150489,237,118466,048,00002,285,568
4May 5, 2025 09:0656,150498,300,859465,041,0001,000,0002,265,088
5May 5, 2025 09:0656,152494,902,465464,065,0002,000,0002,277,376
6May 5, 2025 09:0656,152495,018,484465,063,0001,000,0002,285,568
7May 5, 2025 09:0656,160493,148,020464,124,0002,000,0002,260,992
8May 5, 2025 09:0656,167492,517,397465,185,0001,000,0002,260,992
9May 5, 2025 09:0656,181492,680,477465,304,0001,000,0002,277,376