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 19, 2024 02:01zielajzielajScore: 3,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 02:013,53850,624,75428,353,0001,012,0002,338,816
2Nov 19, 2024 02:013,55056,641,86729,466,00002,523,136
3Nov 19, 2024 02:013,57959,902,72628,680,0001,024,0002,523,136
4Nov 19, 2024 02:013,71556,435,19628,844,0001,989,0002,531,328
5Nov 19, 2024 02:013,71759,096,75029,852,000995,0002,531,328
6Nov 19, 2024 02:013,74852,059,49630,104,0001,003,0002,531,328