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 17, 2024 01:39zielajzielajScore: 3,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 01:393,59657,326,38027,860,0001,990,0002,387,968
2Nov 17, 2024 01:393,68855,879,96030,614,00002,383,872
3Nov 17, 2024 01:393,72254,970,29729,895,000996,0002,387,968
4Nov 17, 2024 01:393,95456,135,94230,831,0001,989,0002,527,232
5Nov 17, 2024 01:393,95657,577,34330,842,0001,989,0002,498,560
6Nov 17, 2024 01:393,99257,933,37231,124,0002,008,0002,527,232