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 listNov 8, 2024 17:59Alexey TarasovAlexey TarasovScore: 70,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:5970,269608,306,932582,236,0001,000,0002,293,760
2Nov 8, 2024 17:5970,351606,246,310581,912,0001,999,0002,367,488
3Nov 8, 2024 17:5970,430612,974,355583,570,000999,0002,293,760